Multigrid Methods With Newton-Gauss-Seidel Smoothing and Constraint Preserving Interpolation for Obstacle Problems

Numerical Mathematics - United Kingdom
doi 10.4208/nmtma.2015.w08si
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Global Science Press

Related search

Domain Decomposition and Multigrid Methods for Obstacle Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Multigrid Methods for Elliptic Obstacle Problems on 2D Bisection Grids

Lecture Notes in Computational Science and Engineering
ControlCombinatoricsDiscrete MathematicsSimulationEngineeringOptimizationModelingComputational Mathematics
2010English

Newton-Type Methods for Optimization Problems Without Constraint Qualifications

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
2004English

Interval Linear Constraint Solving Using the Preconditioned Interval Gauss-Seidel Method

1995English

A Unified Proof for the Convergence of Jacobi and Gauss–Seidel Methods

SIAM Review
Computational MathematicsApplied MathematicsTheoretical Computer Science
1995English

Comparison Theorem With Modified Gauss-Seidel and Modified Jacobi Methods by M-Matrix

Journal of Interpolation and Approximation in Scientific Computing
2012English

New Results on Gap-Treating Techniques in Extended Interval Newton Gauss-Seidel Steps for Global Optimization

Developments in Global Optimization
1997English

Schwarz Methods for Obstacle Problems With Convection-Diffusion Operators

Contemporary Mathematics
Mathematics
1994English

Generalized Newton Methods for Crack Problems With Nonpenetration Condition

Numerical Methods for Partial Differential Equations
Computational MathematicsApplied MathematicsNumerical AnalysisAnalysis
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy