Numerical Path Following and Eigenvalue Criteria for Branch Switching
暂无分享,去创建一个
[1] M. Crisfield. A FAST INCREMENTAL/ITERATIVE SOLUTION PROCEDURE THAT HANDLES "SNAP-THROUGH" , 1981 .
[2] T. Chan,et al. Iterative Methods for Solving Bordered Systems with Applications to Continuation Methods , 1985 .
[3] Hans D. Mittelmann,et al. An efficient algorithm for bifurcation problems of variational inequalities , 1981 .
[4] John E. Dennis,et al. Numerical methods for unconstrained optimization and nonlinear equations , 1983, Prentice Hall series in computational mathematics.
[5] W. Rheinboldt,et al. On steplength algorithms for a class of continuation methods siam j numer anal , 1981 .
[6] H. Weber. Multigrid Bifurcation Iteration , 1985 .
[7] Werner C. Rheinboldt,et al. Solution Fields of Nonlinear Equations and Continuation Methods , 1980 .
[8] Axel Ruhe,et al. The spectral transformation Lánczos method for the numerical solution of large sparse generalized symmetric eigenvalue problems , 1980 .
[9] T. Chan,et al. Nonlinearly Preconditioned Krylov Subspace Methods for Discrete Newton Algorithms , 1984 .
[10] Axel Ruhe. ALGORITHMS FOR THE NONLINEAR EIGENVALUE PROBLEM , 1973 .
[11] Y. Saad,et al. Practical Use of Some Krylov Subspace Methods for Solving Indefinite and Nonsymmetric Linear Systems , 1984 .