Skip to main navigation
Skip to search
Skip to main content
NYU Scholars Home
Help & FAQ
Home
Profiles
Research units
Research output
Search by expertise, name or affiliation
BDDC algorithms for incompressible Stokes equations
Jing Li, Olof Widlund
Mathematics
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'BDDC algorithms for incompressible Stokes equations'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Incompressible Stokes Equations
100%
Constraint Algorithm
100%
Balancing Domain Decomposition by Constraints
100%
Differential Equations
25%
Non-overlapping
25%
Finite Element
25%
Closest Connection
25%
Positive Definite
25%
Tears
25%
Substructure Method
25%
Space Components
25%
Saddle Point Problem
25%
Stokes
25%
Mixed Finite Elements
25%
Conjugate Gradient Method
25%
Domain Decomposition Method
25%
Dual-primal
25%
Iterative Substructuring
25%
FETI-DP
25%
Continuity Constraint
25%
Coarse Space
25%
Bounds on the Rate of Convergence
25%
Engineering
Stokes Equation
100%
Domain Decomposition
100%
Finite Element Method
40%
Subdomains
40%
Saddle Point
20%
Positive Definite
20%
Conjugate Gradient Method
20%
Rate of Convergence
20%
Mathematics
Elliptic Case
20%
Mixed Finite Element Method
20%