On Optimal Short Recurrences for Generating Orthogonal Krylov Subspace Bases
- Author
- LIESEN, J1 ; STRAKOS, Z2
[1] Institute of Mathematics, Technical University of Berlin, Strafie des 17. Juni 136, 10623 Berlin, Germany
[2] Institute of Computer Science, Academy of Sciences of the Czech Republic, Pod Vod. věží 2, 182 07 Prague, Czech Republic - Source
SIAM review (Print). 2008, Vol 50, Num 3, pp 485-503, 19 p ; ref : 48 ref
- CODEN
- SIREAD
- ISSN
- 0036-1445
- Scientific domain
- Control theory, operational research; Mathematics
- Publisher
- Society for Industrial and Applied Mathematics, Philadelphia, PA
- Publication country
- United States
- Document type
- Article
- Language
- English
- Author keyword
- 15A57 65F25 Krylov subspace methods conjugate gradient-like methods; 65F10 orthogonal bases short recurrences
- Keyword (fr)
- Article synthèse Calcul scientifique Concept Condition nécessaire suffisante Condition nécessaire Condition suffisante Estimation erreur Mathématiques appliquées Méthode sousespace Krylov Orthogonalité Preuve Produit Relation récurrence Récurrence Système linéaire Vecteur 14C20 46Cxx 65F05 Base orthogonale
- Keyword (en)
- Review Scientific computation Concept Necessary and sufficient condition Necessary condition Sufficient condition Error estimation Applied mathematics Krylov subspace method Orthogonality Proof Product Recurrence relation Recurrence Linear system Vector Orthogonal basis
- Keyword (es)
- Artículo síntesis Computación científica Concepto Condición necesaria suficiente Condición necesaria Condición suficiente Estimación error Matemáticas aplicadas Método subespacio Krylov Ortogonalidad Prueba Producto Relación recurrencia Recurrencia Sistema lineal Vector
- Classification
- Pascal
- 001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02C Algebra / 001A02C05 Algebraic geometry
- Pascal
- 001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02E Mathematical analysis / 001A02E16 Functional analysis
- Pascal
- 001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02I Numerical analysis. Scientific computation / 001A02I01 Numerical analysis / 001A02I01E Numerical linear algebra
- Pascal
- 001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02I Numerical analysis. Scientific computation / 001A02I02 Methods of scientific computing (including symbolic computation, algebraic computation)
- Discipline
- Mathematics
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 20581379
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1137/060662149 
https://dx.doi.org/10.1137/060662149
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:17:\"10.1137\/060662149\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:76:\"On Optimal Short Recurrences for Generating Orthogonal Krylov Subspace Bases\";s:9:\"\u0000*\u0000jtitle\";s:19:\"SIAM review (Print)\";s:9:\"\u0000*\u0000stitle\";s:17:\"SIAM rev. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:2:\"50\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:3:\"485\";s:8:\"\u0000*\u0000epage\";s:3:\"503\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0036-1445\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"LIESEN\";s:10:\"\u0000*\u0000aufirst\";s:1:\"J\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:10:\"STRAKOS, Z\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"SIREAD\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:76:\"On Optimal Short Recurrences for Generating Orthogonal Krylov Subspace Bases\";s:8:\"\u0000*\u0000place\";s:16:\"Philadelphia, PA\";s:6:\"\u0000*\u0000pub\";s:46:\"Society for Industrial and Applied Mathematics\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"19\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:17:\"10.1137\/060662149\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:76:\"On Optimal Short Recurrences for Generating Orthogonal Krylov Subspace Bases\";s:9:\"\u0000*\u0000jtitle\";s:19:\"SIAM review (Print)\";s:9:\"\u0000*\u0000stitle\";s:17:\"SIAM rev. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:2:\"50\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:3:\"485\";s:8:\"\u0000*\u0000epage\";s:3:\"503\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0036-1445\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"LIESEN\";s:10:\"\u0000*\u0000aufirst\";s:1:\"J\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:10:\"STRAKOS, Z\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"SIREAD\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:76:\"On Optimal Short Recurrences for Generating Orthogonal Krylov Subspace Bases\";s:8:\"\u0000*\u0000place\";s:16:\"Philadelphia, PA\";s:6:\"\u0000*\u0000pub\";s:46:\"Society for Industrial and Applied Mathematics\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"19\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:17:\"10.1137\/060662149\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:17:\"10.1137\/060662149\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:76:\"On Optimal Short Recurrences for Generating Orthogonal Krylov Subspace Bases\";s:9:\"\u0000*\u0000jtitle\";s:19:\"SIAM review (Print)\";s:9:\"\u0000*\u0000stitle\";s:17:\"SIAM rev. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:2:\"50\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:3:\"485\";s:8:\"\u0000*\u0000epage\";s:3:\"503\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0036-1445\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"LIESEN\";s:10:\"\u0000*\u0000aufirst\";s:1:\"J\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:10:\"STRAKOS, Z\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"SIREAD\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:76:\"On Optimal Short Recurrences for Generating Orthogonal Krylov Subspace Bases\";s:8:\"\u0000*\u0000place\";s:16:\"Philadelphia, PA\";s:6:\"\u0000*\u0000pub\";s:46:\"Society for Industrial and Applied Mathematics\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"19\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:17:\"10.1137\/060662149\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:76:\"On Optimal Short Recurrences for Generating Orthogonal Krylov Subspace Bases\";s:9:\"\u0000*\u0000jtitle\";s:19:\"SIAM review (Print)\";s:9:\"\u0000*\u0000stitle\";s:17:\"SIAM rev. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:2:\"50\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:3:\"485\";s:8:\"\u0000*\u0000epage\";s:3:\"503\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0036-1445\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"LIESEN\";s:10:\"\u0000*\u0000aufirst\";s:1:\"J\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:10:\"STRAKOS, Z\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"SIREAD\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:76:\"On Optimal Short Recurrences for Generating Orthogonal Krylov Subspace Bases\";s:8:\"\u0000*\u0000place\";s:16:\"Philadelphia, PA\";s:6:\"\u0000*\u0000pub\";s:46:\"Society for Industrial and Applied Mathematics\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"19\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
