This repository contains the code and experiments for the Master's thesis on preconditioning strategies for iterative methods applied to the Vecchia-Laplace approximation, developed using the GPBoost ...

Abstract: An iterative procedure is presented which permits the determination of a rational transfer function in the Laplace transform variable s which is optimal with respect to given input and ...

We introduce some iterative methods for solving the linear system $\boldsymbol{Ax}=\boldsymbol{b}$ in this chapter. Why do we need iterative methods? Reduce the cost ...

Abstract: One way to find an analytic approximation of the input impedance of thin wire antennas is to make an educated guess of the current distribution, which is then used for the induced ...

Therefore, a line-search algorithm is an iterative process that optimizes a nonlinear function of one parameter () within each iteration k of the optimization technique, which itself tries to optimize ...

ABSTRACT: To overcome the problem of calculation errors in the Born approximation when the forward accumulation effect is strong in VTI media, this article combines the De Wolf approximation method ...

The circumference of a sphere is measured to be 24 cm, with a possible error of 0.25 cm. Use the differential \(dV\) to estimate the maximum error in the calculated ...

The travelling salesman problem (TSP) remains one of the most challenging NP‐hard problems in combinatorial optimisation, with significant implications for logistics, network design and route planning ...