Related papers: On solving nonlinear simultaneous equations arisin…
Fixed-point iterative sweeping methods were developed in the literature to efficiently solve steady state solutions of Hamilton-Jacobi equations and hyperbolic conservation laws. Similar as other fast sweeping schemes, the key components of…
In this paper, first we introduce a new mapping for finding a common fixed point of an infinite family of nonexpansive mappings then we consider iterative method for finding a common element of the set of fixed points of an infinite family…
The theory of mixed finite element methods for solving different types of elliptic partial differential equations in saddle point formulation is well established since many decades. This topic was mostly studied for variational formulations…
It is shown by means of reiterated two-scale convergence in the Sobolev-Orlicz setting, that the sequence of solutions of a class of highly oscillatory problems involving nonlinear elliptic operators with nonstandard growth, converges to a…
In the present study, we solve initial boundary value problem construted on nonlinear Klein-Gordon equation. The collocation method on exponential cubic B-spline functions forming a set of basis for the functions defined in the same…
Non-linear least squares solvers are used across a broad range of offline and real-time model fitting problems. Most improvements of the basic Gauss-Newton algorithm tackle convergence guarantees or leverage the sparsity of the underlying…
Recent literature reports two sectional techniques, the finite volume method [Das et al., 2020, SIAM J. Sci. Comput., 42(6): B1570-B1598] and the fixed pivot technique [Kushwah et al., 2023, Commun. Nonlinear Sci. Numer. Simul., 121(37):…
Employing the ideas of non-linear preconditioning and testing of the classical proximal point method, we formalise common arguments in convergence rate and convergence proofs of optimisation methods to the verification of a simple…
In this paper, a class of optimization problems with nonlinear inequality constraints is discussed. Based on the ideas of sequential quadratic programming algorithm and the method of strongly sub-feasible directions, a new superlinearly…
This paper proposes an explicit computational method for solving a three-dimensional system of nonlinear elastodynamic sine-Gordon equations subject to appropriate initial and boundary conditions. The time derivative is approximated by…
We consider a simple initial-boundary-value problem for the shallow water equations in one space dimension, and also the analogous problem for a symmetric variant of the system. Assuming smoothness of solutions, we discretize these problems…
We study a cutting-plane method for semidefinite optimization problems (SDOs), and supply a proof of the method's convergence, under a boundedness assumption. By relating the method's rate of convergence to an initial outer approximation's…
One common approach to detecting change-points is minimizing a cost function over possible numbers and locations of change-points. The framework includes several well-established procedures, such as the penalized likelihood and minimum…
We develop a new randomized iterative algorithm---stochastic dual ascent (SDA)---for finding the projection of a given vector onto the solution space of a linear system. The method is dual in nature: with the dual being a non-strongly…
This paper presents an innovative continuous linear finite element approach to effectively solve biharmonic problems on surfaces. The key idea behind this method lies in the strategic utilization of a surface gradient recovery operator to…
In this paper, we consider the nonsmooth convex optimization problems over the fixed point constraint sets of firmly nonexpansive operators. To find an optimal solution of the problem, we present an iterative method based on the hybrid…
The authors propose and analyze a well-posed numerical scheme for a type of ill-posed elliptic Cauchy problem by using a constrained minimization approach combined with the weak Galerkin finite element method. The resulting Euler-Lagrange…
In this paper we consider the numerical approximation of the two-phase membrane (obstacle) problem by finite difference method. First, we introduce the notion of viscosity solution for the problem and construct certain discrete nonlinear…
The coordinate descent method is an effective iterative method for solving large linear least-squares problems. In this paper, for the highly coherent columns case, we construct an effective coordinate descent method which iteratively…
We present an efficient second-order finite difference scheme for solving the 2D sine-Gordon equation, which can inherit the discrete energy conservation for the undamped model theoretically. Due to the semi-implicit treatment for the…