Skip to main content
Log in

Numerical solution of separable nonlinear equations with a singular matrix at the solution

  • Original Paper
  • Published:
Numerical Algorithms Aims and scope Submit manuscript

Abstract

We present a numerical method for solving the separable nonlinear equation A(y)z + b(y) = 0, where A(y) is an m × N matrix and b(y) is a vector, with yRn and zRN. We assume that the equation has an exact solution (y, z). We permit the matrix A(y) to be singular at the solution y and also possibly in a neighborhood of y, while the rank of the matrix A(y) near y may differ from the rank of A(y) itself. We previously developed a method for this problem for the case m = n + N, that is, when the number of equations equals the number of variables. That method, based on bordering the matrix A(y) and finding a solution of the corresponding extended system of equations, could produce a solution of the extended system that does not correspond to a solution of the original problem. Here, we develop a new quadratically convergent method that applies to the more general case mn + N and produces all of the solutions of the original system without introducing any extraneous solutions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Deuflhard, P., Hohmann, A.: Numerical analysis in modern scientific computing, 2nd edn. Springer, New York (2003)

    Book  Google Scholar 

  2. Eriksson, J., Wedin, P.-A.: Truncated Gauss-Newton algorithms for ill-conditioned nonlinear least squares problems. Optim. Methods Softw. 19(6), 721–737 (2004)

    Article  MathSciNet  Google Scholar 

  3. Eriksson, J., Wedin, P.-A., Gulliksson, M.E., Soderkvist, I.: Regularization methods for uniformly rank-deficient nonlinear least-squares problems. J. Optim. Theory Appl. 127(1), 1–26 (2005)

    Article  MathSciNet  Google Scholar 

  4. Golub, G.H., Pereyra, V.: The differentiation of pseudo-inverses and nonlinear least squares problems whose variables separate. Stanford Univ. CS Dept Report STAN-CS-72-261 (1972)

  5. Golub, G.H., Pereyra, V.: The differentiation of pseudo-inverses and nonlinear least squares problems whose variables separate. SIAM J. Numer. Anal. 10(2), 413–432 (1973)

    Article  MathSciNet  Google Scholar 

  6. Golub, G.H., Pereyra, V.: Separable nonlinear least squares: the variable projection method and its applications. Inverse Problems 19, Topic Review, R1–R26 (2003)

  7. Golub, G.H., Van Loan, C.F.: Matrix computations, 3rd edn. Johns Hopkins, Baltimore (1996)

    MATH  Google Scholar 

  8. Lukeman, G.G.: Separable overdetermined nonlinear systems: an application of the Shen-Ypma Algorithm. VDM Verlag Dr. Müller, Saarbr ücken (2009)

    Google Scholar 

  9. Mullen, K.M., van Stokkum, I.M.: The variable projection algorithm in time-resolved spectroscopy, microscopy and mass spectrometry applications. Numer. Algorithms 51(3), 319–340 (2009)

    Article  MathSciNet  Google Scholar 

  10. Ortega, J.M., Rheinboldt, W.C.: Iterative solution of nonlinear equations in several variables. Academic Press, New York (1970)

    MATH  Google Scholar 

  11. Shen, Y.-Q., Ypma, T.J.: Solving nonlinear systems of equations with only one nonlinear variable. J. Comput. Appl. Math. 30(2), 235–246 (1990)

    Article  MathSciNet  Google Scholar 

  12. Shen, Y.-Q., Ypma, T.J.: Solving rank-deficient separable nonlinear equations. Appl. Numer. Math. 57(5-7), 609–615 (2007)

    Article  MathSciNet  Google Scholar 

  13. Shen, Y.-Q., Ypma, T.J.: Solving separable nonlinear equations using LU factorization. ISRN Math. Anal. 2013, Article ID 258072 5pp (2013)

  14. Shen, Y.-Q., Ypma, T.J.: Rank deficiency and bifurcation into affine subspaces for separable parameterized equations. Math. Comp. 85(297), 271–293 (2016)

    Article  MathSciNet  Google Scholar 

  15. Shen, Y., Ypma, T.J.: An efficient algorithm for the separable nonlinear least squares problem. Algorithms 10(3), Paper 10 10pp (2017)

  16. Shen, Y., Ypma, T.J.: Solving separable nonlinear least squares problems using the QR factorization. J. Comput. Appl. Math. 345, 48–58 (2019)

    Article  MathSciNet  Google Scholar 

  17. Ypma, T.J., Shen, Y.-Q.: Solving N+m nonlinear equations with only m nonlinear variables. Computing 44(3), 259–271 (1990)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tjalling J. Ypma.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shen, Y., Ypma, T.J. Numerical solution of separable nonlinear equations with a singular matrix at the solution. Numer Algor 85, 1195–1211 (2020). https://doi.org/10.1007/s11075-019-00861-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11075-019-00861-0

Keywords

Mathematics Subject Classification (2010)

Navigation