Figure 1.
(A) S2Hssz without CDRA and with reprojections in the dyads. (B) S2rsz without CDRA and without reprojections in the dyads
-
Previous Article
Iterative methods for solving large sparse Lyapunov equations and application to model reduction of index 1 differential-algebraic-equations
- NACO Home
- This Issue
-
Next Article
A Mehrotra type predictor-corrector interior-point algorithm for linear programming
June
2019, 9(2): 157-171.
doi: 10.3934/naco.2019012
A new reprojection of the conjugate directions
Óbuda University, Institute of Applied Mathematics, H-1034 Budapest, Bécsi út 96/b, Hungary |
In the paper we apply a Parlett–Kahan's "twice is enough" type algorithm to conjugate directions. We give a lower bound of the digits of precision of the conjugate directions, too.
Keywords:
Parlett–Kahan's "twice is enough" method,
conjugate directions,
reprojections,
ABS methods.
Mathematics Subject Classification:
Primary: 15A06, 15A18; Secondary: 15A23.
Citation:
József Abaffy. A new reprojection of the conjugate directions. Numerical Algebra, Control & Optimization,
2019, 9
(2)
: 157-171.
doi: 10.3934/naco.2019012
![]()
References:
| [1] |
J. Abaffy and E. Spedicato, ABS Projections Algorithms: Mathematical Techniques for Linear and Nonlinear Algebraic Equations, Ellis Horwood Ltd, Chichester, England, 1989. |
| [2] |
J. Abaffy, Reprojection of the conjugate directions in ABS classes Part I, Acta Polytechnica Hungarica, 13 (2016), 7-24. Google Scholar |
| [3] |
J. Abaffy, Reprojection of the Conjugate Directions in the ABS Class: Part Ⅱ, https://aisberg.unibg.it/handle/10446/86246. Google Scholar |
| [4] |
H. Golub and C. F. Van Loan, Matrix Computation, North Oxford Academic Press, Oxford, 1983.
Google Scholar
|
| [5] |
C. S. Hegedűs, Reorthogonalization Methods Revisited, Acta Polytechnica Hungarica, 12 (2015), 7-26. Google Scholar |
| [6] |
M. R. Hestenes and E. L. Stiefel,
Methods of conjugate gradients for solving linear systems, J. Res. Nat. Bur. Standards Sect, 5 (1952), 409-436.
|
| [7] |
B. N. Parlett, The symmetric Eigenvalue Problem, Englewood Cliffs, N. J. Prentice-Hall, 1980. |
show all references
References:
| [1] |
J. Abaffy and E. Spedicato, ABS Projections Algorithms: Mathematical Techniques for Linear and Nonlinear Algebraic Equations, Ellis Horwood Ltd, Chichester, England, 1989. |
| [2] |
J. Abaffy, Reprojection of the conjugate directions in ABS classes Part I, Acta Polytechnica Hungarica, 13 (2016), 7-24. Google Scholar |
| [3] |
J. Abaffy, Reprojection of the Conjugate Directions in the ABS Class: Part Ⅱ, https://aisberg.unibg.it/handle/10446/86246. Google Scholar |
| [4] |
H. Golub and C. F. Van Loan, Matrix Computation, North Oxford Academic Press, Oxford, 1983.
Google Scholar
|
| [5] |
C. S. Hegedűs, Reorthogonalization Methods Revisited, Acta Polytechnica Hungarica, 12 (2015), 7-26. Google Scholar |
| [6] |
M. R. Hestenes and E. L. Stiefel,
Methods of conjugate gradients for solving linear systems, J. Res. Nat. Bur. Standards Sect, 5 (1952), 409-436.
|
| [7] |
B. N. Parlett, The symmetric Eigenvalue Problem, Englewood Cliffs, N. J. Prentice-Hall, 1980. |
Figure 2.
(A) S2HSsz with CDRA and reprojections in the dyads. (B) S2rsz with CDRA and without reprojections in the dyads
Figure 3.
(A) S2asz with CDRA and reprojections in the dyads.
(B) S2a with CDRA and without reprojections in the dyads
Figure 4.
(A) S2LU with CDRA and reprojections in the dyads.
(B) S2esz with CDRA and without reprojections in the dyads
Figure 5.
(A) S2Hpsz with CDRA and reprojections in the dyads. (B) S2psz with CDRA and without reprojections in the dyads
Figure 6.
(A) S2HSsz with CDRA and reprojections in the dyads. (B) S2rsz with CDRA and without reprojections in the dyads
Figure 7.
(A) S2asz with CDRA and reprojections in the dyads.
(B) S2a with CDRA and without reprojections in the dyads
Figure 8.
(A) S2LU with CDRA and reprojections in the dyads.
(B) S2esz with CDRA and without reprojections in the dyads
Figure 9.
(A) S2Hpsz with CDRA and reprojections in the dyads. (B) S2psz with CDRA and without reprojections in the dyads
Figure 10.
(A) S2HSsz with CDRA and reprojections in the dyads. (B) S2rsz with CDRA and without reprojections in the dyads
Figure 11.
(A) S2asz with CDRA and reprojections in the dyads.
(B) S2a with CDRA and without reprojections in the dyads
Figure 12.
(A) S2LU with CDRA and reprojections in the dyads.
(B) S2esz with CDRA and without reprojections in the dyads
Figure 13.
(A) S2Hpsz with CDRA and reprojections in the dyads. (B) S2psz with CDRA and without reprojections in the dyads
| [1] |
Anurag Jayswala, Tadeusz Antczakb, Shalini Jha. Second order modified objective function method for twice differentiable vector optimization problems over cone constraints. Numerical Algebra, Control & Optimization, 2019, 9 (2) : 133-145. doi: 10.3934/naco.2019010 |
| [2] |
Shishun Li, Zhengda Huang. Guaranteed descent conjugate gradient methods with modified secant condition. Journal of Industrial & Management Optimization, 2008, 4 (4) : 739-755. doi: 10.3934/jimo.2008.4.739 |
| [3] |
Wataru Nakamura, Yasushi Narushima, Hiroshi Yabe. Nonlinear conjugate gradient methods with sufficient descent properties for unconstrained optimization. Journal of Industrial & Management Optimization, 2013, 9 (3) : 595-619. doi: 10.3934/jimo.2013.9.595 |
| [4] |
Alexander Blokh, Eric Teoh. How little is little enough?. Discrete & Continuous Dynamical Systems, 2003, 9 (4) : 969-978. doi: 10.3934/dcds.2003.9.969 |
| [5] |
C.Y. Wang, M.X. Li. Convergence property of the Fletcher-Reeves conjugate gradient method with errors. Journal of Industrial & Management Optimization, 2005, 1 (2) : 193-200. doi: 10.3934/jimo.2005.1.193 |
| [6] |
Nam-Yong Lee, Bradley J. Lucier. Preconditioned conjugate gradient method for boundary artifact-free image deblurring. Inverse Problems & Imaging, 2016, 10 (1) : 195-225. doi: 10.3934/ipi.2016.10.195 |
| [7] |
Guanghui Zhou, Qin Ni, Meilan Zeng. A scaled conjugate gradient method with moving asymptotes for unconstrained optimization problems. Journal of Industrial & Management Optimization, 2017, 13 (2) : 595-608. doi: 10.3934/jimo.2016034 |
| [8] |
El-Sayed M.E. Mostafa. A nonlinear conjugate gradient method for a special class of matrix optimization problems. Journal of Industrial & Management Optimization, 2014, 10 (3) : 883-903. doi: 10.3934/jimo.2014.10.883 |
| [9] |
Xing Li, Chungen Shen, Lei-Hong Zhang. A projected preconditioned conjugate gradient method for the linear response eigenvalue problem. Numerical Algebra, Control & Optimization, 2018, 8 (4) : 389-412. doi: 10.3934/naco.2018025 |
| [10] |
Yigui Ou, Haichan Lin. A class of accelerated conjugate-gradient-like methods based on a modified secant equation. Journal of Industrial & Management Optimization, 2020, 16 (3) : 1503-1518. doi: 10.3934/jimo.2019013 |
| [11] |
Zhong Wan, Chaoming Hu, Zhanlu Yang. A spectral PRP conjugate gradient methods for nonconvex optimization problem based on modified line search. Discrete & Continuous Dynamical Systems - B, 2011, 16 (4) : 1157-1169. doi: 10.3934/dcdsb.2011.16.1157 |
| [12] |
Gaohang Yu, Lutai Guan, Guoyin Li. Global convergence of modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property. Journal of Industrial & Management Optimization, 2008, 4 (3) : 565-579. doi: 10.3934/jimo.2008.4.565 |
| [13] |
Ya Li, ShouQiang Du, YuanYuan Chen. Modified spectral PRP conjugate gradient method for solving tensor eigenvalue complementarity problems. Journal of Industrial & Management Optimization, 2020 doi: 10.3934/jimo.2020147 |
| [14] |
Saman Babaie–Kafaki, Reza Ghanbari. A class of descent four–term extension of the Dai–Liao conjugate gradient method based on the scaled memoryless BFGS update. Journal of Industrial & Management Optimization, 2017, 13 (2) : 649-658. doi: 10.3934/jimo.2016038 |
| [15] |
Min Li. A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method. Journal of Industrial & Management Optimization, 2020, 16 (1) : 245-260. doi: 10.3934/jimo.2018149 |
| [16] |
Per Christian Moan, Jitse Niesen. On an asymptotic method for computing the modified energy for symplectic methods. Discrete & Continuous Dynamical Systems, 2014, 34 (3) : 1105-1120. doi: 10.3934/dcds.2014.34.1105 |
| [17] |
Matthias Eller. A remark on Littman's method of boundary controllability. Evolution Equations & Control Theory, 2013, 2 (4) : 621-630. doi: 10.3934/eect.2013.2.621 |
| [18] |
Christopher M. Kellett. Classical converse theorems in Lyapunov's second method. Discrete & Continuous Dynamical Systems - B, 2015, 20 (8) : 2333-2360. doi: 10.3934/dcdsb.2015.20.2333 |
| [19] |
Mikhail Dokuchaev, Guanglu Zhou, Song Wang. A modification of Galerkin's method for option pricing. Journal of Industrial & Management Optimization, 2021 doi: 10.3934/jimo.2021077 |
| [20] |
Lars Grüne, Peter E. Kloeden, Stefan Siegmund, Fabian R. Wirth. Lyapunov's second method for nonautonomous differential equations. Discrete & Continuous Dynamical Systems, 2007, 18 (2&3) : 375-403. doi: 10.3934/dcds.2007.18.375 |
Impact Factor:
Tools
Metrics
Other articles
by authors
[Back to Top]