Geometry.Net - Pure_And_Applied_Math: Linear Algebra


Home - Pure_And_Applied_Math - Linear Algebra

e99.com Bookstore

Images

Newsgroups

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

Linear Algebra: more books (100)

Problems and Theorems in Linear Algebra (Translations of Mathematical Monographs) by V. V. Prasolov, 1994-06-13
Differential Equations and Linear Algebra by Michael D. Greenberg, 2000-12-15
Abstract Linear Algebra (Universitext) by Morton L. Curtis, 1990-06-25
Linear Algebra and Linear Models (Universitext) by R. B. Bapat, 2000-03-30
An introduction to linear algebra by Robert Charles Fisher, 1970
Elementary Differential Equations with Linear Algebra by Albert L. Rabenstein, 1992-01-02
Linear Algebra: Challenging Problems for Students (Johns Hopkins Studies in the Mathematical Sciences) by Fuzhen Zhang, 2009-04-07
Lectures On Linear Algebra by Mohd Zubair Khan, 2008-03-15
Numerical Linear Algebra on High-Performance Computers (Software, Environments and Tools) by Jack J. Dongarra, Iain S. Duff, et all 1987-01-01
Linear Algebra (Modular Mathematics Series) by Reg Allenby, 1995-01-19
Student Solutions Manual for Applied Linear Algebra by Peter J. Olver, Cheri Shakiban, 2005-09-29
Linear Algebra: Gateway to Mathematics by Robert Messer, 1997-01-23
The Student's Introduction to MATHEMATICA ®: A Handbook for Precalculus, Calculus, and Linear Algebra by Bruce F. Torrence, Eve A. Torrence, 2009-02-02
Linear Algebra in Action (Graduate Studies in Mathematics) by Harry Dym, 2006-12-01

lists with details

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

Extractions: 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. 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. Hageman, L. and Young, D.M. Applied Iterative Methods.
THE $25000000000 EIGENVECTOR THE LINEAR ALGEBRA BEHIND GOOGLE 1
File Format PDF/Adobe Acrobat Quick View
http://www.rose-hulman.edu/~bryan/googleFinalVersionFixed.pdf
SPARSKIT
General purpose Fortran library by Yousef Saad for sparse matrix computations.
http://www-users.cs.umn.edu/~saad/software/SPARSKIT/sparskit.html
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

Extractions: 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 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.
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

Extractions: 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 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).
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/

Extractions: 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. 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):
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/

Extractions: 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
SMMP
Fortran 77 code for sparse matrix multiplication, transposition, and format conversion.
http://www.netlib.org/aicm/smmp

Extractions: #! /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)
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

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