Skip to main content
SpringerLink
Log in

A continuation–domain decomposition algorithm for bifurcation problems

  • Published:
Numerical Algorithms Aims and scope Submit manuscript

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

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, National Chung-Hsing University, Taichung, Taiwan, 402

    C.-S. Chien, H.-S. Chou & B.-W. Jeng

Authors
  1. C.-S. Chien
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H.-S. Chou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. B.-W. Jeng
    View author publications

    You can also search for this author in PubMed Google Scholar

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

Search

Navigation