Name
Title | ||
|---|---|---|
Iterative accelerating algorithms with Krylov subspaces for the solution to large-scale nonlinear problems |
Abstract | ||
|---|---|---|
Discrete solution to nonlinear systems problems that leads to a series of linear problems associated with non-invariant large-scale
sparse symmetric positive matrices is herein considered. Each linear problem is solved iteratively by a conjugate gradient
method. We introduce in this paper new solvers (IRKS, GIRKS and D-GIRKS) that rely on an iterative reuse of Krylov subspaces
associated with previously solved linear problems. Numerical assessments are provided on large-scale engineering applications.
Considerations related to parallel supercomputing are also addressed. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1023/A:1019187614377 | Numerical Algorithms |
Keywords | Field | DocType |
iterative approach,conjugate gradient,Krylov subspaces,superconvergence,Ritz values,nonlinear optimization,parallel supercomputing,65B99,65Y05 | Conjugate gradient method,Mathematical optimization,Nonlinear system,Supercomputer,Mathematical analysis,Iterative method,Matrix (mathematics),Nonlinear programming,Superconvergence,Linear subspace,Mathematics | Journal |
Volume | Issue | ISSN |
23 | 1 | 1572-9265 |
Citations | PageRank | References |
9 | 0.88 | 4 |
Authors | ||
2 | ||