Tensor methods for large, sparse nonlinear least squares problems

SIAM Journal of Scientific Computing

Volumn 21, Issue 4, 1999, Pages 1199-1221

  Bouaricha, Ali ^a   Schnabel, Robert B ^b  

^a ARGONNE NATIONAL LABORATORY   (United States)

^b UCB 450   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FINITE DIFFERENCE METHOD; LEAST SQUARES APPROXIMATIONS; MATHEMATICAL MODELS; MATRIX ALGEBRA; NONLINEAR EQUATIONS; OPTIMIZATION;

RANK DEFICIENT MATRICES; SPARSE PROBLEMS; TENSOR METHODS;

TENSORS;

EID: 0033293030     PISSN: 10648275     EISSN: None     Source Type: None    
DOI: 10.1137/S1064827596297549     Document Type: Article

References (24)

1. M. AL-BAALI AND R. FLETCHER, Variational methods for non-linear least squares, J. Oper. Res. Soc., 36 (1985), pp. 405-421.
2. M. ARIOLI, I. S. DUFF, AND P. P. M. RIJK, On the augmented system approach to sparse least-squares problems, Numer. Math., 55 (1989), pp. 667-684.
3. B. M. AVERICK, J. J. MORÉ, C. H. BISCHOF, A. CARLE, AND A. GRIEWANK, Computing large sparse Jacobian matrices using automatic differentiation, SIAM J. Sci. Comput., 15 (1994), pp. 285-294.
4. Å. BJÖRCK, Iterative refinement of linear least squares solutions, BIT, 7 (1967), pp. 257-278.
5. A. BOUARICHA, Solving Large Sparse Systems of Nonlinear Equations and Nonlinear Least Squares Problems Using Tensor Methods on Sequential and Parallel Computers, Ph.D. thesis, Computer Science Department, University of Colorado. Boulder, CO, 1992.
6. A. BOUARICHA AND R. B. SCHNABEL, Tensor Methods for Large, Sparse Systems of Nonlinear Equations, Preprint MCS-P473-1094, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, 1994.
7. A. BOUARICHA AND R. B. SCHNABEL, Algorithm 768: TENSOLVE: A software package for solving systems of nonlinear equations and nonlinear least squares problems using tensor methods, ACM Trans. Math. Software, 23 (1997), pp. 174-195.
8. J. R. BUNCH, Partial pivoting strategies for symmetric matrices, SIAM J. Numer. Anal., 11 (1974), pp. 521-528.
9. T. F. COLEMAN, B. S. GARBOW, AND J. J. MORÉ, Fortran subroutines for estimating sparse Jacobian matrices, ACM Trans. Math. Software, 10 (1984) pp. 346-347.
10. T. F. COLEMAN, B. S. GARBOW, AND J. J. MORÉ, Software for estimating sparse Jacobian matrices, ACM Trans. Math. Software, 10 (1984), pp. 329-345.
11. T. F. COLEMAN AND J. J. MORÉ, Estimation of sparse Jacobian matrices and graph coloring problems, SIAM J. Numer. Anal., 20 (1983). pp. 187-209.
12. A. M. CURTIS, M. J. D. POWELL, AND J. K. REID, On the estimation of sparse Jacobian matrices, J. Inst. Math. Appl, 13 (1974), pp. 117-120.
13. J. E. DENNIS, D. M. GAY, AND R. E. WELSCH, An adaptive nonlinear least squares algorithm, ACM Trans. Math. Software, 7 (1981), pp. 348-368.
14. J. E. DENNIS AND R. B. SCHNABEL, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, Englewood Cliffs, NJ, 1983.
15. I. S. DUFF, MA28: A Set of Fortran Subroutines for Sparse Unsymmetric Linear Equations, Technical Report R-8730, AERE Harwell Laboratory, Oxfordshire, UK, 1977.
16. I. S. DUFF AND J. K. REID, A comparison of some methods for the solution of sparse overdetermined system, J. Inst. Math. Appl., 17 (1975), pp. 267-280.
17. D. FENG, P. FRANK, AND R. B. SCHNABEL, Local convergence analysis of tensor methods for nonlinear equations, Math. Programming, 62 (1993), pp. 427-459.
18. W. M. GENTLEMAN, Least squares computation by givens transformations without squares roots, J. Inst. Math. Appl., 12 (1973), pp. 329-336.
19. J. R. GILBERT, C. MOLER, AND R. SCHREIBER, Sparse matrices in MATLAB: Design and implementation, SIAM J. Matrix. Anal. Appl., 13 (1992), pp. 333-356.
20. G. H. GOLUB, Numerical methods for solving linear least squares problems, Numer. Math., 7 (1965), pp. 206-216.
21. G. D. HACHTEL, Extended applications of the sparse tableau approach-finite elements and least squares, in Basic Questions of Design Theory, W. R. Spillers, ed., North-Holland, Amsterdam, 1974.
22. G. PETERS AND J. H. WILKINSON, The least squares problem and pseudo-inverses, Comput. J., 13 (1970), pp. 309-316.
23. R. B. SCHNABEL AND P. D. FRANK, Tensor methods for nonlinear equations, SIAM J. Numer. Anal., 21 (1984), pp. 815-843.
24. R. B. SCHNABEL, J. E. KOONTZ, AND B. E. WEISS, A modular system of algorithms of unconstrained minimization, ACM Trans. Math. Software, 11 (1985), pp. 419-440.