Results 51 to 60 of about 1,995 (109)
A family of approximate solutions and explicit error estimates for the nonlinear stationary Navier-Stokes problem [PDF]
An algorithm for solving the nonlinear stationary Navier-Stokes problem is developed. Explicit error estimates are given.
Gabrielsen, R. E., Karel, S.
core +1 more source
An improvement of the product integration method for a weakly singular Hammerstein equation
We present a new method to solve nonlinear Hammerstein equations with weakly singular kernels. The process to approximate the solution, followed usually, consists in adapting the discretization scheme from the linear case in order to obtain a nonlinear ...
Grammont, Laurence, Kaboul, Hanane
core +1 more source
Monotone Iterations for Nonlinear Equations with Application to Gauss-seidel Methods [PDF]
Monotone iterations for nonlinear equations with application to Gauss-Seidel ...
Ortega, J. M., Rheinboldt, W. C.
core +1 more source
The author studies the problem of approximating a locally unique solution of a nonlinear operator equation \( F(x)=0\), where \(F\) is an \(m\)-times Fréchet-differentiable operator (\(m \geq 2\) is a positive integer) defined on a convex subset \(D\) of a Banach space \(E_1\) with values in a Banach space \(E_2\).
openaire +1 more source
Efficient Discrete Optimal Transport Algorithm by Accelerated Gradient Descent. [PDF]
An D, Lei N, Xu X, Gu X.
europepmc +1 more source
We describe a method for calculating the roots of special functions satisfying second order linear ordinary differential equations. It exploits the recent observation that the solutions of a large class of such equations can be represented via ...
Bremer, James
core
Entropy-Regularized Optimal Transport on Multivariate Normal and q-normal Distributions. [PDF]
Tong Q, Kobayashi K.
europepmc +1 more source
A short survey on Kantorovich-like theorems for Newton's method
We survey influential quantitative results on the convergence of the Newton iterator towards simple roots of continuously differentiable maps defined over Banach spaces.
Lecerf, Grégoire, Saadé, Joelle
core +1 more source
In this paper we present a new steepest-descent type algorithm for convex optimization problems. Our algorithm pieces the unknown into sub-blocs of unknowns and considers a partial optimization over each sub-bloc.
Riahi, Mohamed Kamel
core
Missing link survival analysis with applications to available pandemic data. [PDF]
Gámiz ML +3 more
europepmc +1 more source

