Sciweavers

505 search results - page 30 / 101
» Numerical Methods for the Landau-Lifshitz-Gilbert Equation
Sort
View
VLSM
2005
Springer
15 years 6 months ago
Fast Marching Method for Generic Shape from Shading
We develop a fast numerical method to approximate the solutions of a wide class of equations associated to the Shape From Shading problem. Our method, which is based on the control...
Emmanuel Prados, Stefano Soatto
92
Voted
IV
2002
IEEE
124views Visualization» more  IV 2002»
15 years 5 months ago
Numerical Solving of Geometric Constraints
: In computer-aided design, geometric modeling by constraints enables users to describe shapes by relationships called constraints between geometric elements. The problem is to der...
Samy Ait-Aoudia
83
Voted
SIAMSC
2010
117views more  SIAMSC 2010»
14 years 11 months ago
Least-Squares Finite Element Methods for Quantum Electrodynamics
A significant amount of the computational time in large Monte Carlo simulations of lattice field theory is spent inverting the discrete Dirac operator. Unfortunately, traditional...
James J. Brannick, C. Ketelsen, Thomas A. Manteuff...
128
Voted
SIAMJO
2011
14 years 7 months ago
Adaptive Multilevel Inexact SQP Methods for PDE-Constrained Optimization
We present a class of inexact adaptive multilevel trust-region SQP-methods for the efficient solution of optimization problems governed by nonlinear partial differential equations...
J. Carsten Ziems, Stefan Ulbrich
IJCAI
2001
15 years 1 months ago
A Constraint Satisfaction Approach to Parametric Differential Equations
Parametric ordinary differential equations arise in many areas of science and engineering. Since some of the data is uncertain and given by intervals, traditional numerical method...
Micha Janssen, Pascal Van Hentenryck, Yves Deville