相关论文: Numerical Solution of the 3-D Travel Time Tomograp…
A computationally efficient method to solve non-convex programming problems with linear equality constraints is presented. The proposed method is based on a recursively feasible and descending sequential convex programming procedure proven…
In this article, a new solution for the convex hull problem has been presented. The convex hull is a widely known problem in computational geometry. As nature is a rich source of ideas in the field of algorithms, the solution has been…
We consider the 3D stochastic Navier-Stokes equation on the torus. Our main result concerns the temporal and spatio-temporal discretisation of a local strong pathwise solution. We prove optimal convergence rates in for the energy error with…
Transport-Based Morphometry (TBM) has emerged as a new framework for 3D medical image analysis. By embedding images into a transport domain via invertible transformations, TBM facilitates effective classification, regression, and other…
Pointwise accurate numerical methods are constructed and analysed for three classes of singularly perturbed first order transport problems. The methods involve piecewise-uniform Shishkin meshes and the numerical approximations are shown to…
A novel method to compute time eigenvalues of neutron transport problems is presented based on solutions to the time dependent transport equation. Using these solutions we use the dynamic mode decomposition (DMD) to form an approximate…
The problem of optimal mass transport arises in numerous applications including image registration, mesh generation, reflector design, and astrophysics. One approach to solving this problem is via the Monge-Amp\`ere equation. While recent…
Traveling salesman problem is a NP-hard problem. Until now, researchers have not found a polynomial time algorithm for traveling salesman problem. Among the existing algorithms, dynamic programming algorithm can solve the problem in time…
We introduce the convex combinatorial optimization problem, a far reaching generalization of the standard linear combinatorial optimization problem. We show that it is strongly polynomial time solvable over any edge-guaranteed family, and…
The task of voxel resolution for a space curve in video memory of 3D display is set. Furthermore, an approach solution of voxel resolution of arbitrary space curve, given in parametric form, is studied. Numerous numbers of intensive…
Diffusion models have been widely studied as effective generative tools for solving inverse problems. The main ideas focus on performing the reverse sampling process conditioned on noisy measurements, using well-established numerical…
This paper presents an efficient parallel method for the deterministic solution of the 3D stationary Boltzmann transport equation applied to diffusive problems such as nuclear core criticality computations. Based on standard…
We present a numerical method for handling the resolution of a general transport equation for radiative particles, aimed at physical problems with a general spherical geometry. Having in mind the computational time difficulties encountered…
Proposed in this paper is a numerical procedure to generate periodic traveling wave solutions of some nonlinear dispersive wave equations. The method is based on a suitable modification of a fixed point algorithm of Petviahvili type and…
Travel-time tomography seeks to recover a hidden environment from external measurements generated by propagation through an anomalous region. Standard formulations treat propagation as passive, so the environment influences observations…
Keypoint-based representation has proven advantageous in various visual and robotic tasks. However, the existing 2D and 3D methods for detecting keypoints mainly rely on geometric consistency to achieve spatial alignment, neglecting…
In recent years, some traffic information prediction methods have been proposed to provide the precise information of travel time, vehicle speed, and traffic flow for highways. However, big errors may be obtained by these methods for urban…
The forward problem here is the Cauchy problem for a 1D hyperbolic PDE with a variable coefficient in the principal part of the operator. That coefficient is the spatially distributed dielectric constant. The inverse problem consists of the…
Non-linear Trajectory Optimisation (TO) methods require good initial guesses to converge to a locally optimal solution. A feasible guess can often be obtained by allocating a large amount of time for the trajectory to complete. However for…
Distance geometry problem belongs to a class of hard problems in classical computation that can be understood in terms of a set of inputs processed according to a given transformation, and for which the number of possible outcomes grows…