Results 121 to 130 of about 97,762 (292)
Local Analysis of Inexact Quasi-Newton Methods
Quasi-Newton methods are well known iterative methods for solving nonlinear problems. At each stage, a system of linear equations has to be solved. However, for large scale problems, solving the linear system of equations can be expensive and may not be
Eisenstat, Stanley C., Steihaug, Trond
core
Fast Injective Mesh Parameterization via Beltrami Coefficient Prolongation
Abstract We present a highly efficient and robust method for free boundary injective parameterization of disk‐like triangle meshes with low isometric distortion. Harmonic function–based approaches, grounded in a strong mathematical framework, are widely employed.
G. Fargion, O. Weber
wiley +1 more source
The Computation of Quasiterminator Orbits in Asteroid Exploration Based on the Quasi-Newton Method
This paper investigates the computational methods of global mapping quasiterminator orbits in asteroid exploration missions. Quasiterminator orbits can serve as a unified term for terminator orbits and their related trajectories, encompassing certain ...
Qian Wang +3 more
doaj +1 more source
Phase equilibrium calculations with quasi-Newton methods
International audienceThe phase split problem, formulated as an unconstrained minimization of the Gibbs free energy, is commonly solved by the second-order Newton method, preceded by a number of first-order successive substitutions.
Nichita, Dan Vladimir +1 more
core +1 more source
Mesh Processing Non‐Meshes via Neural Displacement Fields
Abstract Mesh processing pipelines are mature, but adapting them to newer non‐mesh surface representations—which enable fast rendering with compact file size—requires costly meshing or transmitting bulky meshes, negating their core benefits for streaming applications.
Yuta Noma +4 more
wiley +1 more source
This paper presents a two-dimensional search algorithm for quasi-Newton methods applied to ill-conditioned and degenerate unconstrained optimization problems. At each iteration, the space is decomposed into an orthogonal sum of two subspaces based on the
Viktor M. Zadachyn
doaj +1 more source
A Newton Collocation Method for Solving Dynamic Bargaining Games [PDF]
We develop and implement a collocation method to solve for an equilibrium in the dynamic legislative bargaining game of Duggan and Kalandrakis (2008). We formulate the collocation equations in a quasi-discrete version of the model, and we show that the ...
John Duggan, Tasos Kalandrakis
core
Pseudo-loadflow formulation as a starting process for the Newton Raphson
This paper introduces new models which approximate the AC loadflow problem, but are able to converge (using the Newton Raphson algorithm) from a wider range of starting points.
Irving, MR
core +1 more source
Progressively Projected Newton's Method
Abstract Newton's Method is widely used to find the solution of complex non‐linear simulation problems. To guarantee a descent direction, it is common practice to clamp the negative eigenvalues of each element Hessian prior to assembly—a strategy known as Projected Newton (PN)—but this perturbation often hinders convergence.
J. A. Fernández‐Fernández +2 more
wiley +1 more source
Skeletal‐Driven Animation of Anatomical Humans via Neural Deformation Gradients
Abstract Most real‐time animation techniques for digital humans are limited to deforming the outer skin surface. Geometric skinning methods are highly efficient but struggle with artifacts such as collapsing joints or self‐intersections when animating inner anatomy along with the outer skin.
G. Nolte +3 more
wiley +1 more source

