16 papers · ranked by Valyu relevance
Srinivasarao Thota, Vivek Kumar Srivastav
Objectives The present paper describes a new algorithm to find a root of non-linear transcendental equations. It is found that Regula-Falsi method always gives guaranteed result but slow convergence. However, Newton-Raphson method does not give guaranteed result but faster than Regula-Falsi method. Therefore, the…
Ronald F. Boisvert, Michael J. Donahue, Daniel W. Lozier, Robert McMichael + 1 more
'Robert McMichael' 'Bert W. Rust'] In this paper we describe the role that mathematics plays in measurement science at NIST. We first survey the history behind NIST’s current work in this area, starting with the NBS Math Tables project of the 1930s. We then provide examples of more recent efforts in the application of…
Yong Li, Gonglin Yuan, Zengxin Wei, Zi-Ke Zhang
In this paper, a trust-region algorithm is proposed for large-scale nonlinear equations, where the limited-memory BFGS (L-M-BFGS) update matrix is used in the trust-region subproblem to improve the effectiveness of the algorithm for large-scale problems. The global convergence of the presented method is established…
Philku Lee, Tai Wan Kim, Seongjai Kim
Elliptic obstacle problems are formulated to find either superharmonic solutions or minimal surfaces that lie on or over the obstacles, by incorporating inequality constraints. In order to solve such problems effectively using finite difference (FD) methods, the article investigates simple iterative algorithms based on…
Xiangrong Li, Xupei Zhao, Xiabin Duan, Xiaoliang Wang + 1 more
'Hans A Kestler'] It is generally acknowledged that the conjugate gradient (CG) method achieves global convergence-with at most a linear convergence rate-because CG formulas are generated by linear approximations of the objective functions. The quadratically convergent results are very limited. We introduce a new PRP…
Ireneusz Gościniak, Krzysztof Gdawiec
There is a huge group of algorithms described in the literature that iteratively find solutions of a given equation. Most of them require tuning. The article presents root-finding algorithms that are based on the Newton-Raphson method which iteratively finds the solutions, and require tuning. The modification of the…
Karine Chemla
Ancient sources attest to the introduction of two families of numeration systems using place-value notations. In such systems, the base and its powers are always represented using position. The existence of a base of this kind is reflected by the repetitive character of the algorithms drawing on the place-value…
Gonglin Yuan, Xiabin Duan, Wenjie Liu, Xiaoliang Wang + 3 more
'Zhou Sheng' 'Yongtang Shi'] Two new PRP conjugate Algorithms are proposed in this paper based on two modified PRP conjugate gradient methods: the first algorithm is proposed for solving unconstrained optimization problems, and the second algorithm is proposed for solving nonlinear equations. The first method contains…
Philipp Hennig, Michael A. Osborne, Mark Girolami
We deliver a call to arms for probabilistic numerical methods: algorithms for numerical tasks, including linear algebra, integration, optimization and solving differential equations, that return uncertainties in their calculations. Such uncertainties, arising from the loss of precision induced by numerical calculation…
Gonglin Yuan, Zhou Sheng, Wenjie Liu, Hans A Kestler
In this paper, the Hager and Zhang (HZ) conjugate gradient (CG) method and the modified HZ (MHZ) CG method are presented for large-scale nonsmooth convex minimization. Under some mild conditions, convergent results of the proposed methods are established. Numerical results show that the presented methods can be better…
Mariusz Pleszczyński, Robertas Damaševičius
Computer tomography has a wide field of applicability; however, most of its applications assume that the data, obtained from the scans of the examined object, satisfy the expectations regarding their amount and quality. Unfortunately, sometimes such expected data cannot be achieved. Then we deal with the incomplete set…
Salima Kouser, Shafiq Ur Rehman, Yasser Elmasry, Waqar Azeem Khan + 3 more
'Fayyaz Ahmad' 'Hamza Khan' 'B. Omkar Lakshmi Jagan'] The Newton method is a classical method for solving systems of nonlinear equations and offers quadratic convergence. The order of convergence of the Newton method is optimal as it requires one evaluation for the system of nonlinear equations and the second for the…
Wei Zhang, Liangli Chen, Mohammed Jasim Mohammed Alfahdawi
Barycentric rational interpolation is characterized by excellent numerical stability, high approximation accuracy, and strong adaptability to node distribution. In this paper, we propose a high-precision barycentric rational interpolation collocation method to provide approximate solutions for both linear and nonlinear…
T. A. Biala, S. N. Jator
In this article, the boundary value method is applied to solve three dimensional elliptic and hyperbolic partial differential equations. The partial derivatives with respect to two of the spatial variables (y, z) are discretized using finite difference approximations to obtain a large system of ordinary differential…
Liru Mu, Xinlong Feng, José F. F. Mendes
In this paper, the radial basis function finite difference method is used to solve two-dimensional steady incompressible Navier-Stokes equations. First, the radial basis function finite difference method with polynomial is used to discretize the spatial operator. Then, the Oseen iterative scheme is used to deal with…
Li Zuo, Fengtai Mei
Since the nonlinear parabolic equation has many variables, its calculation process is mostly an algebraic operation, which makes it difficult to express the discrete process concisely, which makes it difficult to effectively solve the two grid algorithm problems and the convergence problem of reaction diffusion. The…