The alternating-direction iterative method for saddle point problems
- Author
- PENG, Xiao-Fei1 2 ; WEN LI3
[1] School of Mathematics, Central South University, Changsha 410083, China
[2] Nanhai College, South China Normal University, Foshan 528225, China
[3] School of Mathematical Sciences, South China Normal University, Guangzhou 510631, China - Conference title
- Workshop on Iterative Methods and Preconditioning Techniques
- Conference name
- Workshop on Iterative Methods and Preconditioning Techniques (Suzhou 2009-03-22)
- Author (monograph)
- BAI, Zhong-Zhi (Editor)1 ; DAI, Hua (Editor)2 ; LIU, Xing-Ping (Editor)3 ; YIN, Jung-Feng (Editor)4
Tongji University, Department of Applied Mathematics, Shangai, China (Organiser of meeting)
[1] Institute of Computational Mathematics, Chinese Academy of Sciences, Beijing, China
[2] Department of Mathematics, Nanjing University of Aeronautics and Astronautics, Nanjing, China
[3] Laboratory of Computational Physics, Institute of Applied Physics and Computational Mathematics, Beijing, China
[4] Department of Applied Mathematics, Tongji University, Shangai, China - Source
Applied mathematics and computation. 2010, Vol 216, Num 6, pp 1845-1858, 14 p ; ref : 15 ref
- CODEN
- AMHCBQ
- ISSN
- 0096-3003
- Scientific domain
- Control theory, operational research; Computer science; Mathematics
- Publisher
- Elsevier, Amsterdam
- Publication country
- Netherlands
- Document type
- Conference Paper
- Language
- English
- Author keyword
- Convergence Matrix splitting Saddle point problem The alternating-direction iterative method The optimal parameter
- Keyword (fr)
- Accélération convergence Algorithme optimal Algèbre linéaire numérique Analyse numérique Convergence Mathématiques appliquées Méthode direction alternée Méthode itérative Résolution problème Système linéaire Taux convergence 65B99 65F08 65F10 Analyse convergence Point selle Splitting
- Keyword (en)
- Convergence acceleration Optimal algorithm Numerical linear algebra Numerical analysis Convergence Applied mathematics Alternating direction method Iterative method Problem solving Linear system Convergence rate Splitting
- Keyword (es)
- Aceleración convergencia Algoritmo óptimo Algebra lineal numérica Análisis numérico Convergencia Matemáticas aplicadas Método dirección alternada Método iterativo Resolución problema Sistema lineal Relación convergencia
- Classification
- Pascal
- 001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02E Mathematical analysis
- Pascal
- 001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02I Numerical analysis. Scientific computation / 001A02I01 Numerical analysis / 001A02I01B Acceleration of convergence
- 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
- Discipline
- Mathematics
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 22828894
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.1016/j.amc.2009.12.020 
https://dx.doi.org/10.1016/j.amc.2009.12.020
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.amc.2009.12.020\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:68:\"The alternating-direction iterative method for saddle point problems\";s:9:\"\u0000*\u0000jtitle\";s:35:\"Applied mathematics and computation\";s:9:\"\u0000*\u0000stitle\";s:18:\"Appl. math. comput\";s:7:\"\u0000*\u0000date\";s:4:\"2010\";s:9:\"\u0000*\u0000volume\";s:3:\"216\";s:8:\"\u0000*\u0000issue\";s:1:\"6\";s:8:\"\u0000*\u0000spage\";s:4:\"1845\";s:8:\"\u0000*\u0000epage\";s:4:\"1858\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0096-3003\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"PENG\";s:10:\"\u0000*\u0000aufirst\";s:8:\"Xiao-Fei\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:6:\"WEN LI\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"AMHCBQ\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:60:\"Workshop on Iterative Methods and Preconditioning Techniques\";s:8:\"\u0000*\u0000title\";s:68:\"The alternating-direction iterative method for saddle point problems\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"14\";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:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.amc.2009.12.020\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:68:\"The alternating-direction iterative method for saddle point problems\";s:9:\"\u0000*\u0000jtitle\";s:35:\"Applied mathematics and computation\";s:9:\"\u0000*\u0000stitle\";s:18:\"Appl. math. comput\";s:7:\"\u0000*\u0000date\";s:4:\"2010\";s:9:\"\u0000*\u0000volume\";s:3:\"216\";s:8:\"\u0000*\u0000issue\";s:1:\"6\";s:8:\"\u0000*\u0000spage\";s:4:\"1845\";s:8:\"\u0000*\u0000epage\";s:4:\"1858\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0096-3003\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"PENG\";s:10:\"\u0000*\u0000aufirst\";s:8:\"Xiao-Fei\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:6:\"WEN LI\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"AMHCBQ\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:60:\"Workshop on Iterative Methods and Preconditioning Techniques\";s:8:\"\u0000*\u0000title\";s:68:\"The alternating-direction iterative method for saddle point problems\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"14\";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:25:\"10.1016\/j.amc.2009.12.020\";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:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.amc.2009.12.020\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:68:\"The alternating-direction iterative method for saddle point problems\";s:9:\"\u0000*\u0000jtitle\";s:35:\"Applied mathematics and computation\";s:9:\"\u0000*\u0000stitle\";s:18:\"Appl. math. comput\";s:7:\"\u0000*\u0000date\";s:4:\"2010\";s:9:\"\u0000*\u0000volume\";s:3:\"216\";s:8:\"\u0000*\u0000issue\";s:1:\"6\";s:8:\"\u0000*\u0000spage\";s:4:\"1845\";s:8:\"\u0000*\u0000epage\";s:4:\"1858\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0096-3003\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"PENG\";s:10:\"\u0000*\u0000aufirst\";s:8:\"Xiao-Fei\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:6:\"WEN LI\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"AMHCBQ\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:60:\"Workshop on Iterative Methods and Preconditioning Techniques\";s:8:\"\u0000*\u0000title\";s:68:\"The alternating-direction iterative method for saddle point problems\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"14\";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:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.amc.2009.12.020\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:68:\"The alternating-direction iterative method for saddle point problems\";s:9:\"\u0000*\u0000jtitle\";s:35:\"Applied mathematics and computation\";s:9:\"\u0000*\u0000stitle\";s:18:\"Appl. math. comput\";s:7:\"\u0000*\u0000date\";s:4:\"2010\";s:9:\"\u0000*\u0000volume\";s:3:\"216\";s:8:\"\u0000*\u0000issue\";s:1:\"6\";s:8:\"\u0000*\u0000spage\";s:4:\"1845\";s:8:\"\u0000*\u0000epage\";s:4:\"1858\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0096-3003\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"PENG\";s:10:\"\u0000*\u0000aufirst\";s:8:\"Xiao-Fei\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:6:\"WEN LI\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"AMHCBQ\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:60:\"Workshop on Iterative Methods and Preconditioning Techniques\";s:8:\"\u0000*\u0000title\";s:68:\"The alternating-direction iterative method for saddle point problems\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"14\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.amc.2009.12.020\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:68:\"The alternating-direction iterative method for saddle point problems\";s:9:\"\u0000*\u0000jtitle\";s:35:\"Applied mathematics and computation\";s:9:\"\u0000*\u0000stitle\";s:18:\"Appl. math. comput\";s:7:\"\u0000*\u0000date\";s:4:\"2010\";s:9:\"\u0000*\u0000volume\";s:3:\"216\";s:8:\"\u0000*\u0000issue\";s:1:\"6\";s:8:\"\u0000*\u0000spage\";s:4:\"1845\";s:8:\"\u0000*\u0000epage\";s:4:\"1858\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0096-3003\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"PENG\";s:10:\"\u0000*\u0000aufirst\";s:8:\"Xiao-Fei\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:6:\"WEN LI\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"AMHCBQ\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:60:\"Workshop on Iterative Methods and Preconditioning Techniques\";s:8:\"\u0000*\u0000title\";s:68:\"The alternating-direction iterative method for saddle point problems\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"14\";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
