What people are saying - Write a review
We haven't found any reviews in the usual places.
On the use of sparsity in the solution of finite
Superconvergence phenomena for finite element
Numerical procedures for the eigenvalue problem
1 other sections not shown
Other editions - View all
active constraints algorithm Anal arithmetic operations asymptotic expansions band or envelope base problem Canosa and Gomes Cholesky factorization coefficients Comp Computer consider convergence corresponding defined denote diagonal blocks difference approximations discussed eigenvector error estimate facet finite difference finite element matrices Finite Element Method Galerkin method Gaussian Gaussian elimination given global Golub gradient Hessian matrix inverse iteration iteration method J.H. Wilkinson knots KT point leading principal minor linear constraint problems linear programming M.R. Osborne Math nested dissection nonlinear constraint nonlinear eigenvalue problems NONLINEAR PROGRAMMING nonzero elements optimal ordinary differential equations penalty function point boundary problem polynomial positive definite procedure programming problem Pruess quadratic quasi-Newton method Rayleigh Quotient scheme Schur complement separating sets sequence SIAM Numer smallest eigenvalue solving sparse matrices sparsity step storage superconvergence phenomena Superconvergence results symmetric theorem triangular factors unconstrained minimization value problems variable metric vector Xk+1 zero