Skip to main content
Log in

A continuation–domain decomposition algorithm for bifurcation problems

  • Published:
Numerical Algorithms Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

We study numerical solution branches of certain parameter-dependent problems defined on compact domains with various boundary conditions. The finite differences combined with the domain decomposition method are exploited to discretize the partial differential equations. We propose efficient numerical algorithms for solving the associated linear systems and for the detection of bifurcation points. Sample numerical results are reported.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chien, CS., Chou, HS. & Jeng, BW. A continuation–domain decomposition algorithm for bifurcation problems. Numerical Algorithms 22, 367–383 (1999). https://doi.org/10.1023/A:1019119126672

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1019119126672

Navigation