Idealized Steepest Descent Method and Its Approximate Example
Abstract
It was proved that when the step of steepest descent method is the reciprocals of the eigenvalues of the non-singular coefficient matrix A of equation Ax=b,the iteration can converge to exact solution in m-step,where m is its degree of minimal polynomial.This is an idealized steepest descent method.However,since the calculation of eigenvalues is not easy,only approximate estimates can be used in actuarial calculation.This paper studies the...
Paper Details
Title
Idealized Steepest Descent Method and Its Approximate Example
Published Date
Jan 1, 2011
Citation AnalysisPro
You’ll need to upgrade your plan to Pro
Looking to understand the true influence of a researcher’s work across journals & affiliations?
- Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
- Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.
Notes
History