Conjugate gradient methods for continuation problems II

Chien, C.-S.; Lu, Ni-Yu; Weng, Zhifeng

doi:10.1016/0377-0427(94)00104-4

Search citation statements

Order By: Relevance

Paper Sections

Select...

Computed Examples1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

1997

2008

Publication Types

Select...

Article5

Relationship

Self Cite0

Independent5

Authors

Journals

Cited by 6 publications

(1 citation statement)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This yields a system of ( − 1) 2 are approximations of the function u at the grid points. Numerous techniques for computing w(λ) as λ is increased from, say, λ 0 to λ 1 are available; see, e.g., [1,5,6] and the references therein.…”

Section: Computed Examplesmentioning

confidence: 99%

The Arnoldi Process and GMRES for Nearly Symmetric Matrices

Beckermann¹,

Reichel²

2008

SIAM J. Matrix Anal. & Appl.

View full text Add to dashboard Cite

Abstract. Matrices with a skew-symmetric part of low rank arise in many applications, including path following methods and integral equations. This paper explores the properties of the Arnoldi process when applied to such a matrix. We show that an orthogonal Krylov subspace basis can be generated with short recursion formulas and that the Hessenberg matrix generated by the Arnoldi process has a structure, which makes it possible to derive a progressive GMRES method. Eigenvalue computation is also considered.

show abstract

Section: Computed Examplesmentioning

confidence: 99%