Related papers: Generalization of the Secant Method for Nonlinear …
In most introductory numerical analysis textbooks, the treatment of a single nonlinear equation often consists of a collection of all-purpose methods that frequently do not work or are inefficient. These textbooks neglect to teach the…
Functional iterations such as Newton's are a popular tool for polynomial root-finding. We consider realistic situation where some (e.g., better-conditioned) roots have already been approximated and where further computations is directed to…
In this paper the simplicial cone constrained convex quadratic programming problem is studied. The optimality conditions of this problem consist in a linear complementarity problem. This fact, under a suitable condition, leads to an…
A method based on order completion for solving general equations is presented. In particular, this method can be used for solving large classes of nonlinear systems of PDEs, with possibly associated initial and/or boundary value problems.
Inexact Newton Methods are widely used to solve systems of nonlinear equations. The convergence of these methods is controlled by the relative linear tolerance, $\eta_\nu$, that is also called the forcing term. A very small $\eta_\nu$ may…
Fourier series multiscale method, a concise and efficient analytical approach for multiscale computation, will be developed out of this series of papers. In the third paper, the analytical analysis of multiscale phenomena inherent in the…
In this paper, we propose a smoothing method to solve nonlinear complementarity problems involving P 0-functions. We propose a nonparametric algorithm to solve the nonlinear corresponding system of equations and prove some global and local…
We apply the Simple Equations Method (SEsM) for obtaining exact solutions of nonlinear differential equations. We discuss several examples with goal to illustrate the results from the use of derivatives of composite functions in the…
We propose new linear combinations of compositions of a basic second-order scheme with appropriately chosen coefficients to construct higher order numerical integrators for differential equations. They can be considered as a generalization…
We propose an iterative estimating equations procedure for analysis of longitudinal data. We show that, under very mild conditions, the probability that the procedure converges at an exponential rate tends to one as the sample size…
We discuss the last version as well as applications of a method for obtaining exact solutions of nonlinear partial differential equations. As this version is based on more than one simple equation we call it Simple Equations Method (SEsM).…
We present a Newton-type method that converges fast from any initialization and for arbitrary convex objectives with Lipschitz Hessians. We achieve this by merging the ideas of cubic regularization with a certain adaptive…
In this paper, applied strictly monotonic increasing scaled maps, a kind of well-conditioned linear barycentric rational interpolations are proposed to approximate functions of singularities at the origin, such as $x^\alpha$ for $\alpha \in…
We discuss a version the methodology for obtaining exact solutions of nonlinear partial differential equations based on the possibility for use of: (i) more than one simplest equation; (ii) relationship that contains as particular cases the…
The null vector method, based on a simple linear algebraic concept, is proposed as a solution to the phase retrieval problem. In the case with complex Gaussian random measurement matrices, a non-asymptotic error bound is derived, yielding…
This paper presents a novel framework for high-dimensional nonlinear quantum computation that exploits tensor products of amplified vector and matrix encodings to efficiently evaluate multivariate polynomials. The approach enables the…
A block decomposition method is proposed for minimizing a (possibly non-convex) continuously differentiable function subject to one linear equality constraint and simple bounds on the variables. The proposed method iteratively selects a…
In this paper, we use Fourier analysis to study the superconvergence of the semi-discrete discontinuous Galerkin method for scalar linear advection equations in one spatial dimension. The error bounds and asymptotic errors are derived for…
A method of representation of a solution as segments of the series in powers of the step of the independent variable is expanded for solving complex systems of ordinary differential equations (ODE): the Lorenz system and other systems. A…
The objective of this publication is to reduce the sensitivity of iterative equation solvers on the initial value. To this end, at the hand of Newton's method, we exemplify how to reformulate the initial problem by means of a set of…