What people are saying - Write a review
We haven't found any reviews in the usual places.
A Numerical Method for Determining the Charac
The Application of Polynomials of Best Approxi
Some Estimates for the Method of Steepest
1 other sections not shown
Other editions - View all
A. N. Krylov accordingly the vectors affinor arbitrary vector boundary points charac characteristic equation characteristic number characteristic plane CX characteristic planes belonging characteristic planes constructed characteristic polynomial characteristic value Chebyshev polynomial common construct the system construct the vectors convergence coordinates determination diagonal differentiable equal to zero formula 17 Gaussian elimination H(xn hyperplane initial vector istic plane Jordan normal form L. V. Kantorovich let us construct linear combination linear operator linearly independent vectors matrix method of iterations method of steepest n-dimensional space nomial non-multiple point number of operations obtain orthogonal matrix plane OL polynomial 0(x polynomial of best problem proper numbers recurrence formula region of attraction root of multiplicity Russian by Curtis second scheme second series sequence solution steepest descent strength structural vectors subspace system of equations system of vectors Theorem tion triangular table triangular vector table vector space Wallace Givens