121. NSPCG Home Page Fortran 77 subroutines for solving large sparse linear systems by adaptive accelerated iterative algorithms. http://rene.ma.utexas.edu/CNA/NSPCG/

NSPCG Software Package NSPCG was developed at the Center for Numerical Analysis , the University of Texas at Austin , by Thomas Oppe, Wayne Joubert, David Kincaid, and David Young. It is a collection of Fortran subroutines for solving large sparse linear systems by adaptive accelerated iterative algorithms. Please send email to Dr. David R. Kincaid if you have any questions about NSPCG. Download Information Message NSPCG Source Code, Part 1 NSPCG Source Code, Part 2 NSPCG Source Code, Part 3 ... NSPCG User's Guide in LaTeX Quick Reference Guide for NSPCG in LaTeX Online Manuals NSPCG User's Guide Quick Reference Guide for NSPCG Installation You should create a directory for the downloaded files. Note that you can compile your program using the following command: % % f77 source.f myprog.f % Please consult your system administrator for more information about the Fortran compiler on your system. See the NSPCG User's Guide for details on how to use the routines in the package. Publications Hageman, L. and Young, D.M. Applied Iterative Methods.

122. THE $25000000000 EIGENVECTOR THE LINEAR ALGEBRA BEHIND GOOGLE 1 File Format PDF/Adobe Acrobat Quick View http://www.rose-hulman.edu/~bryan/googleFinalVersionFixed.pdf

123. SPARSKIT General purpose Fortran library by Yousef Saad for sparse matrix computations. http://www-users.cs.umn.edu/~saad/software/SPARSKIT/sparskit.html

A basic tool-kit for sparse matrix computations (Version 2) Author/maintainer Yousef Saad University of Minnesota Department of Computer Science and Engineering 200 Union Street S.E., Minneapolis, MN 55455 USA [saad -at- cs -dot- -umn- -dot- -edu-] Support Work supported by various agencies - during the years 19882000. Date of latest update : Wed Nov 18 13:14:43 CST 2009 1. SOFTWARE AND DOCUMENTATION Documentation: "SPARSKIT: A basic tool-kit for sparse matrix computations" Post-script . Read this first before copying the software. See also the Lesser GNU License terms. Compressed tar file of the whole package (includes all documentation). 2. FTP SITE You can also access the SPARSKIT via anonymous FTP. FTP to ftp.cs.umn.edu. Login as `anonymous' and use your full login address as passwd. Then cd to /dept/sparse. You will find a compressed tar file named SPARSKIT2.tar.gz. You can retrieve the compressed tar file SPARSKIT2.tar.gz (use `binary' before `get' when FTP'ing) The whole package (uncompiled) will take about 3.339 MB of memory. Read carefully the README file in the main directory SPARSKIT2. Send any comments, requests or complaints to [saad at cs at umn dot edu]

124. SYMMLQ: Sparse Symmetric Equations Solves a set of sparse, symmetric linear equations using a conjugate gradient type method. http://www.stanford.edu/group/SOL/software/symmlq.html

Home Software Personnel Students, Alumni, Visitors ... Systems Using SOL Publications Books Dissertations Journal Papers Classics ... Dantzig Memoriam In association with SCCM iCME Memorial Fellowships Dantzig-Lieberman Fund Gene Golub Fund Systems Optimization Laboratory Stanford University Huang Engineering Center Stanford, CA 94305-4121 USA SYMMLQ: Sparse Symmetric Equations AUTHORS: C. C. Paige M. A. Saunders CONTENTS: Implementation of a conjugate-gradient type method for solving sparse linear equations: Solve Ax = b or (A - sI)x = b The matrix A - sI must be symmetric and nonsingular, but it may be definite or indefinite. The scalar s is a shifting parameter it may be any number. The method is based on Lanczos tridiagonalization. You may provide a preconditioner, but it must be positive definite. If A - sI is symmetric but singular, use MINRES If A is unsymmetric, use LSQR REFERENCES: C. C. Paige and M. A. Saunders (1975).

125. Freely Available SOL Optimization Software Code for sparse linear equations (symmetric or general) and sparse least squares, and updating a dense square factorization L C = U. http://www.stanford.edu/group/SOL/software.html

Home Software Personnel Students, Alumni, Visitors ... Systems Using SOL Publications Books Dissertations Journal Papers Classics ... Dantzig Memoriam In association with SCCM iCME Memorial Fellowships Dantzig-Lieberman Fund Gene Golub Fund Systems Optimization Laboratory Stanford University Huang Engineering Center Stanford, CA 94305-4121 USA Freely Available Optimization Software The following software packages are provided by SOL under the terms of the OSI Common Public License (CPL) . The software may alternatively be used under the terms of a BSD License BSDlicense.txt SYMMLQ : Fortran and MATLAB software for sparse symmetric linear equations Ax = b, where A is definite or indefinite. (Iterative method. Allows a positive-definite preconditioner.) MINRES : Fortran and MATLAB software for sparse symmetric linear equations Ax = b, where A is definite or indefinite, possibly singular. (Iterative method. Allows a positive-definite preconditioner.) MINRES-QLP cgLanczos : MATLAB software for sparse symmetric positive-definite linear equations Ax = b. (Iterative method; Lanczos-based implementation of CG, the conjugate-gradient method.) Special feature: Returns an estimate of the diagonals of inv(A).

126. PROPACK - Software For Large And Sparse SVD Calculations Software by Rasmus Munk Larsen for large and sparse SVD calculations, with versions in Fortran and Matlab. http://sun.stanford.edu/~rmunk/PROPACK/

Welcome to the PROPACK homepage The software package PROPACK contains a set of functions for computing the singular value decomposition of large and sparse or structured matrices. The SVD routines are based on the Lanczos bidiagonalization algorithm with partial reorthogonalization (BPRO). The Lanczos routines can also be used directly, and form the basis of efficient algorithms for solving linear systems of equations and linear least squares problems, in particular for systems with multiple right-hand sides. Software Fortran version: A short overview and installation instructions are given here Version 2.1 (April 20, 2005): PROPACK77_v2.1.tar.gz Changelog Version 2.0 (March 17, 2004): PROPACK77_v2.0.tar.gz Changelog Version 1.2 (Jan 30, 2004): PROPACK77_v1.2.tar.gz Changelog Version 1.1 (June 13, 2003): PROPACK77_v1.1.tar.gz Changelog Version 1.0 (May 1, 2001): PROPACK77_v1.0.tar.gz The Fortran version is currently supported on the following platforms: OS architecture compiler OpenMP version Linux GNU g77 No Linux Intel ifort Yes Linux GNU g77 No Linux Intel ifort Yes Linux GNU g77 No Linux Intel ifort Yes SunOS Sparc Sun WorkShop Compilers f90 No IRIX MIPS MIPSpro f77 Yes AIX Power 4 IBM xlf Yes Mac OS X / Darwin PPC IBM xlf No Version 1.1 (March 2004):

127. SVDPACK Comprised of four numerical (iterative) methods for computing the singular value decomposition (SVD) of large sparse matrices using double precision Fortran 77. http://www.netlib.org/svdpack/

SVDPACK Click here to see the number of accesses to this library. The email address svdpack@cs.utk.edu may be used for general discussions. Comments and questions may also be sent to the author at berry@cs.utk.edu file readme for description of SVDPACK file clas3.tgz for SVD of large sparse nonhermitian complex matrices by Michael W. Berry and Min Liang ref M. Berry, "Large Scale Singular Value Computations", , International Journal of Supercomputer Applications , 6:1, (1992), pp. 13-49. prec double complex lang Fortran77 alg Lanczos Algorithm (LANSO) for A'A with Selective Reorthogonalization see svdpack/las2 or svdpack/lad2 file ijsa.ps for M. Berry, "Large Scale Singular Value Computations", , International Journal of Supercomputer Applications , 6:1, (1992), pp. 13-49 file for SVD of large sparse matrices by Michael W. Berry ref M. Berry, "Large Scale Singular Value Computations", , International Journal of Supercomputer Applications , 6:1, (1992), pp. 13-49. prec double lang Fortran77 alg Single vector Lanczos for equivalent 2-cyclic eigensystems file for Documentation for las1 from SVDPACK by Michael W. Berry see svdpack/las1 file

128. SMMP Fortran 77 code for sparse matrix multiplication, transposition, and format conversion. http://www.netlib.org/aicm/smmp

#! /bin/sh # This is a shell archive. Remove anything before this line, then unpack # it by saving it into a file and typing "sh file". To overwrite existing # files, type "sh file -c". You can also feed this as standard input via # unshar, or by typing "sh 'aicm.tex' <- duplicates X ib(j+1) = ib(j+1)-1 X ja(jj) = -j X k = ia(j+1)

129. LINSOL Solves large and sparse linear systems using iterative techniques based on generalized conjugate gradient type methods. Free software released under the GNU General Public License. http://www.rz.uni-karlsruhe.de/rd/linsol.php

Page 7     121-129 of 129    Back | 1  | 2  | 3  | 4  | 5  | 6  | 7