Registered users receive a variety of benefits including the ability to customize email alerts, create favorite journals list, and save searches.
Please note that a Project Euclid web account does not automatically grant access to full-text content. An institutional or society member subscription is required to view non-Open Access content.
Contact firstname.lastname@example.org with any questions.
We construct a biparametric family of fourth-order iterative methods to compute multiple roots of nonlinear equations. This method is verified to be optimally convergent. Various nonlinear equations confirm our proposed method with order of convergence of four and show that the computed asymptotic error constant agrees with the theoretical one.
The dispersion behaviour of leaking hydrogen in a partially open space is simulated by a balancing domain decomposition method in this work. An analogy of the Boussinesq approximation is employed to describe the connection between the flow field and the concentration field. The linear systems of Navier-Stokes equations and the convection diffusion equation are symmetrized by a pressure stabilized Lagrange-Galerkin method, and thus a balancing domain decomposition method is enabled to solve the interface problem of the domain decomposition system. Numerical results are validated by comparing with the experimental data and available numerical results. The dilution effect of ventilation is investigated, especially at the doors, where flow pattern is complicated and oscillations appear in the past research reported by other researchers. The transient behaviour of hydrogen and the process of accumulation in the partially open space are discussed, and more details are revealed by large scale computation.
A wavelet iterative method based on a numerical integration by using the Coiflets orthogonal wavelets for a nonlinear fractional differential equation is proposed. With the help of Laplace transform, the fractional differential equation was converted into equivalent integral equation of convolution type. By using the wavelet approximate scheme of a function, the undesired jump or wiggle phenomenon near the boundary points was avoided and the expansion constants in the approximation of arbitrary nonlinear term of the unknown function can be explicitly expressed in finite terms of the expansion ones of the approximation of the unknown function. Then a numerical integration method for the convolution is presented. As an example, an iterative method which can solve the singular nonlinear fractional Riccati equations is proposed. Numerical results are performed to show the efficiency of the method proposed.
The preconditioner presented by Hadjidimos et al. (2003) can improve on the convergence rate of the classical iterative methods to solve linear systems. In this paper, we extend this preconditioner to solve linear complementarity problems whose coefficient matrix is M-matrix or H-matrix and present a multisplitting and Schwarz method. The convergence theorems are given. The numerical experiments show that the methods are efficient.
We establish convergence theorems of Newton-Kantorovich type for a family of new modified Halley’s method in Banach space to solve nonlinear operator equations. We present the corresponding error estimate. To show the application of our theorems, two numerical examples are given.
Two families of third-order iterative methods for finding multiple roots of nonlinear equations are developed in this paper. Mild conditions are given to assure the cubic convergence of two iteration schemes (I) and (II). The presented families include many third-order methods for finding multiple roots, such as the known Dong's methods and Neta's method. Some new concrete iterative methods are provided. Each member of the two families requires two evaluations of the function and one of its first derivative per iteration. All these methods require the knowledge of the multiplicity. The obtained methods are also compared in their performance with various other iteration methods via numerical examples, and it is observed that these have better performance than the modified Newton method, and demonstrate at least equal performance to iterative methods of the same order.
The management of a car-rental service becomes more complex as long as one-way bookings between different depots are accepted. These bookings can increase the operational costs due to the necessity of moving vehicles from one depot to another by the company staff in order to attend previously accepted bookings. We present an iterative model based on flows on networks for the acceptance of bookings by a car-rental service that permits one-way reservations. Our model lets us also recover the movement of the fleet of vehicles between the depots over the time. In addition, it also permits including restrictions on the amount of cars managed at every single depot. These results can be of interest for an electric car-rental service that operates at different depots within a city or region.
A class of optimal iterative methods for solving nonlinear equations is extended up to sixteenth-order of convergence. We design them by using the weight function technique, with functions of three variables. Some numerical tests are made in order to confirm the theoretical results and to compare the new methods with other known ones.
We investigate a new higher order iterative method for computing the generalized inverse for a given matrix . We also discuss how the new method could be applied for finding approximate inverses of nonsingular square matrices. Analysis of convergence is included to show that the proposed scheme has at least fifteenth-order convergence. Some tests are also presented to show the superiority of the new method.
A class of iterative methods without restriction on the computation of Fréchet derivatives including multisteps for solving systems of nonlinear equations is presented. By considering a frozen Jacobian, we provide a class of m-step methods with order of convergence . A new method named as Steffensen-Schulz scheme is also contributed. Numerical tests and comparisons with the existing methods are included.
This paper presents a computational iterative method to find approximate inverses for the inverse of matrices. Analysis of convergence reveals that the method reaches ninth-order convergence. The extension of the proposed iterative method for computing Moore-Penrose inverse is furnished. Numerical results including the comparisons with different existing methods of the same type in the literature will also be presented to manifest the superiority of the new algorithm in finding approximate inverses.
We are concerned with the following third-order three-point boundary value problem: , where and . Although corresponding Green's function is sign-changing, we still obtain the existence of monotone positive solution under some suitable conditions on by applying iterative method. An example is also included to illustrate the main results obtained.