Search
Search Results
-
A Fast Algorithm for Computing the Digamma Function
AbstractA fast algorithm for calculating the logarithmic derivative of the Euler gamma function based on the BVE method is constructed. The...
-
Fast Algorithm for Solving Some Three-Dimensional Inverse Problems of Magnetometry
AbstractTypical three-dimensional inverse problems of magnetic prospecting are considered: determination of the vector density of magnetic dipoles in...
-
TR-STF: a fast and accurate tensor ring decomposition algorithm via defined scaled tri-factorization
This paper proposes an algorithm based on defined scaled tri-factorization (STF) for fast and accurate tensor ring (TR) decomposition. First, based...
-
A fast primal-dual algorithm via dynamical system with variable mass for linearly constrained convex optimization
We aim to solve the linearly constrained convex optimization problem whose objective function is the sum of a differentiable function and a...
-
A fast and robust algorithm for solving biobjective mixed integer programs
AbstractWe present a fast and robust algorithm for solving biobjective mixed integer linear programs. Two existing methods are studied:
... 
-
A fast randomized algorithm for computing an approximate null space
Randomized algorithms in numerical linear algebra can be fast, scalable and robust. This paper examines the effect of sketching on the right singular...
-
RETRACTED ARTICLE: A fast adaptive algorithm for nonlinear inverse problems with convex penalty
In this paper, we propose a fast adaptive algorithm for solving nonlinear inverse problems in Hilbert spaces. The iterative process of the proposed...
-
Simple and fast algorithm for binary integer and online linear programming
In this paper, we develop a simple and fast online algorithm for solving a class of binary integer linear programs (LPs) arisen in general resource...
-
A Nesterov Type Algorithm with Double Tikhonov Regularization: Fast Convergence of the Function Values and Strong Convergence to the Minimal Norm Solution
We investigate the strong convergence properties of a Nesterov type algorithm with two Tikhonov regularization terms in connection to the...
-
Fast algorithm for viscous Cahn-Hilliard equation
The main purpose of this paper is to solve the viscous Cahn-Hilliard equation via a fast algorithm based on the two time-mesh (TT-M) finite element...
-
A Fast Monte Carlo Algorithm for Evaluating Matrix Functions with Application in Complex Networks
We propose a novel stochastic algorithm that randomly samples entire rows and columns of the matrix as a way to approximate an arbitrary matrix...
-
A simple and fast linear-time algorithm for divisor methods of apportionment
Proportional apportionment is the problem of assigning seats to states (resp. parties) according to their relative share of the population (resp....
-
Fast Algorithm for the Quadratic Knapsack Problem
AbstractThe paper considers the quadratic programming problem with a strictly convex separable objective function, a single linear constraint, and...
-
Fast Cadzow’s Algorithm and a Gradient Variant
The Cadzow’s algorithm is a signal denoising and recovery method which was designed for signals corresponding to low rank Hankel matrices. In this...
-
A Fast Algorithm for Computing the Number of Magic Series
We present a fast algorithm for computing the number of magic series, an enumeration problem of a certain integer partition. Kinnaes showed that the...
-
-
Fast inertial dynamic algorithm with smoothing method for nonsmooth convex optimization
In order to solve the minimization of a nonsmooth convex function, we design an inertial second-order dynamic algorithm, which is obtained by...
-
An improved fast iterative shrinkage thresholding algorithm with an error for image deblurring problem
In this paper, we introduce a new iterative forward-backward splitting method with an error for solving the variational inclusion problem of the sum...
-
Stabilization and variations to the adaptive local iterative filtering algorithm: the fast resampled iterative filtering method
Non-stationary signals are ubiquitous in real life. Many techniques have been proposed in the last decades which allow decomposing multi-component...
-
Fast searching on cactus graphs
The problem of finding the fast search number of a graph is NP-complete. It is challenging even when the graph has very small treewidth. However, it...
