A generalized LSQR algorithm

Lothar Reichel; Qiang Ye

doi:10.1002/nla.611

A generalized LSQR algorithm

Lothar Reichel
, Qiang Ye

Producción científica: Article › revisión exhaustiva

14 Citas (Scopus)

Resumen

LSQR is a popular iterative method for the solution of large linear system of equations and least-squares problems. This paper presents a generalization of LSQR that allows the choice of an arbitrary initial vector for the solution subspace. Computed examples illustrate the benefit of being able to choose this vector.

Idioma original	English
Páginas (desde-hasta)	643-660
Número de páginas	18
Publicación	Numerical Linear Algebra with Applications
Volumen	15
N.º	7
DOI	https://doi.org/10.1002/nla.611
Estado	Published - sept 2008

ASJC Scopus subject areas

Algebra and Number Theory
Applied Mathematics

Acceder al documento

10.1002/nla.611

Otros archivos y enlaces

Citar esto

@article{77dfce1c36484b58bd9ccf3fc0f52605,

title = "A generalized LSQR algorithm",

abstract = "LSQR is a popular iterative method for the solution of large linear system of equations and least-squares problems. This paper presents a generalization of LSQR that allows the choice of an arbitrary initial vector for the solution subspace. Computed examples illustrate the benefit of being able to choose this vector.",

keywords = "Iterative method, Least-squares problem, Linear discrete ill-posed problem, Linear system of equations",

author = "Lothar Reichel and Qiang Ye",

year = "2008",

month = sep,

doi = "10.1002/nla.611",

language = "English",

volume = "15",

pages = "643--660",

number = "7",

}

TY - JOUR

T1 - A generalized LSQR algorithm

AU - Reichel, Lothar

AU - Ye, Qiang

PY - 2008/9

Y1 - 2008/9

N2 - LSQR is a popular iterative method for the solution of large linear system of equations and least-squares problems. This paper presents a generalization of LSQR that allows the choice of an arbitrary initial vector for the solution subspace. Computed examples illustrate the benefit of being able to choose this vector.

AB - LSQR is a popular iterative method for the solution of large linear system of equations and least-squares problems. This paper presents a generalization of LSQR that allows the choice of an arbitrary initial vector for the solution subspace. Computed examples illustrate the benefit of being able to choose this vector.

KW - Iterative method

KW - Least-squares problem

KW - Linear discrete ill-posed problem

KW - Linear system of equations

UR - https://www.scopus.com/pages/publications/52649135474

UR - https://www.scopus.com/pages/publications/52649135474#tab=citedBy

U2 - 10.1002/nla.611

DO - 10.1002/nla.611

M3 - Article

AN - SCOPUS:52649135474

SN - 1070-5325

VL - 15

SP - 643

EP - 660

JO - Numerical Linear Algebra with Applications

JF - Numerical Linear Algebra with Applications

IS - 7

ER -

A generalized LSQR algorithm

Resumen

ASJC Scopus subject areas

Acceder al documento

Otros archivos y enlaces

Huella

Citar esto