PARTIAL SOLUTION OF EIGENPROBLEMS BY A DECOMPOSITION METHOD—I. THEORY

REFERENCES

• Jennings. A.McKeown, J. J. ( 1993 ) Matrix Computations . 2nd edition , Wiley , London .
   Google Scholar
• Bathe , K. J. and Ramaswamy , S. lpar; 1980 ) An accelerated subspace iteration method . Computer Methods Appl. Meek Eng" 23 , 313 – 331 .
   Web of Science ®Google Scholar
• Bathe , K. J. and Wilson , E.L. ( 1973 ) Eigensolution or large structural systems with small bandwidth . ASCE J. EM Div ., 99 , 467 – 479 .
   Google Scholar
• Golub , G. H. and Van Loan , C. F. ( 1983 ) Matrix Computations . Johns Hopkins University Press , Baltimore .
   Google Scholar
• Brabdury , W. and Fletcher , R. ( 1966 ) New iterative methods for the solution of eigenproblem . Numer. Math ., 9 , 259 – 267 .
   Google Scholar
• Beliveau , J. G. , Lemieux , P. and Soucy , Y. ( 1985 ) Partial solution of large symmetric generalized eigenvalue problem by nonlinear optimization of a modified Rayleigh quotient . Computers and Structures , 21 , 807 – 813 .
   Google Scholar
• Rodrigue, G. ( 1973 ) A gradient method for the matrix eigenvalue problem . Numer. Math ., 22 , 1 – 16 .
   Google Scholar
• Perdon , A. and Gambolati , G. ( 1986 ) Extreme eigenvalues of large sparse matrices by Rayleigh quotient and modified conjugate gradient . Comp. Methods Appl. Mech. Eng ., 56 , 251 – 264 .
   Web of Science ®Google Scholar
• Gambolati , G. , Pini , G. and Sartoretto , F. ( 1988 ) An improved iterative optimization technique for ihe leftmost eigenpairs of large symmetric matrices . J. Computational Physics , 74 , 41 – 60 .
   Google Scholar
• Sartoretto , F. , Pini , G. and Gambolati , G. ( 1989 ) Accelerated simultaneous iterations for large finite element eigenproblems . J. Computational Physics . 81 , 53 – 69 .
   Google Scholar
• Gambolati , G. , Sartoretto , F. and Florian , P. ( 1992 ) An orthogonal accelerated deflation technique for large symmetric eigenproblems . Comp. Meih. Appl. Mech. Eng ., 94 , 13 – 23 .
   Web of Science ®Google Scholar
• Marcos , B. and Beliveau , J. G. ( 1988 ) Partial eigensolution of damped structures by nonlinear optimization . Int. J. Numer. Meth. Eny ., 26 , 143 – 152 .
   Google Scholar
• Marcos , B. and Beliveau , J. G. ( 1990 ) Nonlinear optimization technique for partial solution of generalized eigenvalue problems . Int. J. Numer. Meth. Eny ., 29 , 473 – 482 .
   Google Scholar
• Gambolati , G. and Putti , M. ( 1994 ) A comparison of Lanczos and optimization methods in the partial solution of sparse symmetric eigenproblems . Int. J. Numer. Meth. Eny ., 37 , 605 – 621 .
   Web of Science ®Google Scholar
• Ng , K. Y. K. and Sancho , N. G. F. ( 1977 ) A new algorithm for solving certain variational problems . J. Optimization Theory and Applications . 22 , 389 – 397 .
   Web of Science ®Google Scholar
• Ng , K. Y. K. and Sancho , N. G. F. ( 1980 ) Dynamic programming algorithm for optimizing distributed parameter trajectories with constraints . Automatica . 16 , 197 – 203 .
   Web of Science ®Google Scholar
• Ng , K. Y. K. and Sancho , N. G. F. ( 1988 ) Dynamic programming, reduction of dimensionality and eigenvalue problems . Computers and Mathematics with Applications . 16 , 789 – 799 .
   Web of Science ®Google Scholar
• Ng , K. Y. K. and Sancho , N. G. F. ( 1990 ) Dynamic programming, reduction of dimensionality and eigenvalue problems-II . multidimensional case. Engineering Optimization , 15 , 257 – 266 .
   Google Scholar
• Wong , M. L. and Ng , K. Y. K. ( 1993 ) Dynamic programming, reduction of dimensionality and matrix eigenvalue computations . Engineering Optimization 20 , 241 – 259 .
   Google Scholar
• Glover, F. ( 1975 ) Surrogate constraint duality in mathematical programming . Operations Research , 23 , 434 – 451 .
   Web of Science ®Google Scholar
• Greenberg , H.J. Pierskaila ( 1970 ) Surrogate mathematical programming . Operations Research , 18 , 924 – 939 .
   Web of Science ®Google Scholar
• Templeman , A. B. and Li , X. S. ( 1987 ) A maximum entropy approach to constrained nonlinear programming . Eingineeriny Optimization , 12 , 191 – 205 .
   Google Scholar
• Li, X. S! ( 1991 ) An aggregate constraint method for nonlinear programming . J. Operational Research Society , 42 , 1003 – 1010 .
   Web of Science ®Google Scholar
• Lee, E.S. ( 1965 ) Quasitinearization and Invariant Imbedding . Academic Press , N.Y .
   Google Scholar
• Leuberger, D.G. ( 1973 ) linear and Nonlinear Programming . Addison-Wesley , Reading , Mass .
   Google Scholar
• Jennings, A. ( 1985 ) Solution of sparse eigenvalue problems . In Sparsity and its Applications , edited by D.J. Evans , Cambridge University Press , Cambridge .
   Google Scholar
• Frank, W. L. ( 1958 ) Computing eigenvalues of complex matrices by determinant evaluation and by methods of Danilewski and Wielandt . J. SI AM , 6 , 378 – 392 .
   Google Scholar
• Box , G. E. P. and Jenkins , G. M. ( 1976 ) Time Series AInalysi's-Forecasting and Control . Wiley , New York .
   Google Scholar