Back to Results
First PageMeta Content
Numerical linear algebra / Abstract algebra / Matrices / Functional analysis / Generalized minimal residual method / Krylov subspace / Projection / Hessenberg matrix / Rank / Algebra / Mathematics / Linear algebra


Flexible and multi-shift induced dimension reduction algorithms for solving large sparse linear systems
Add to Reading List

Document Date: 2011-11-24 05:39:56


Open Document

File Size: 1,40 MB

Share Result on Facebook

City

Delft / Hamburg / /

Company

SOLVING LARGE SPARSE LINEAR SYSTEMS / /

Country

Germany / Netherlands / /

/

Facility

Institute of Applied Mathematics / Delft University of Technology / Utrecht University / DELFT UNIVERSITY OF TECHNOLOGY REPORT / Mathematical Institute / /

IndustryTerm

large sparse nonsymmetric linear systems / implementable algorithms / approximate solution / dimension reduction algorithms / long recurrence algorithm / possible algorithms / quasi-minimal residual algorithm / linear systems / large sparse linear systems / precise algorithm / stable algorithm / /

Organization

Mathematical Institute / Department of Applied Mathematical Analysis Delft / DELFT UNIVERSITY OF TECHNOLOGY REPORT / Department of Applied Mathematical Analysis / DELFT UNIVERSITY OF TECHNOLOGY / Utrecht University / Institut f¨ / Institute of Applied Mathematics / /

Person

Martin B. van Gijzen / Gerard L.G. Sleijpen / Jens-Peter M. Zemke / Jens-Peter Zemke / /

Technology

stable algorithm / solution algorithms / detailed algorithm / specific algorithm / main algorithms / relatively easily implementable algorithms / AV / resulting algorithm / dimension reduction algorithms / precise algorithm / solution algorithm / long recurrence algorithm / Simulation / quasi-minimal residual algorithm / two algorithms / /

SocialTag