A Family of Root Finding Methods.
A family of sixth-order compact finite-difference schemes for the three-dimensional Poisson equation.
A fast algorithm for blind channel identification.
A fast algorithm for filtering and wavelet decomposition on the sphere.
A fast algorithm for scalar Nevanlinna-Pick interpolation.
A fast algorithm for solving regularized total least squares problems.
A fast algorithm for the construction of recurrence relations for modified moments
A new approach is presented for constructing recurrence relations for the modified moments of a function with respect to the Gegenbauer polynomials.
A fast algorithm for the two dimensional HJB equation of stochastic control
This paper analyses the implementation of the generalized finite differences method for the HJB equation of stochastic control, introduced by two of the authors in [Bonnans and Zidani, SIAM J. Numer. Anal. 41 (2003) 1008–1021]. The computation of coefficients needs to solve at each point of the grid (and for each control) a linear programming problem. We show here that, for two dimensional problems, this linear programming problem can be solved in operations, where is the size of the stencil....
A fast algorithm for the two dimensional HJB equation of stochastic control
This paper analyses the implementation of the generalized finite differences method for the HJB equation of stochastic control, introduced by two of the authors in [Bonnans and Zidani, SIAM J. Numer. Anal.41 (2003) 1008–1021]. The computation of coefficients needs to solve at each point of the grid (and for each control) a linear programming problem. We show here that, for two dimensional problems, this linear programming problem can be solved in O(pmax) operations, where pmax is the size of...
A fast floating-point square-rooting routine for the 8080/8085 microprocessors
A fast iteration for uniform approximation
The paper gives such an iterative method for special Chebyshev approxiamtions that its order of convergence is . Somewhat comparable results are found in [1] and [2], based on another idea.
A Fast Iterative Method for Solving Stationary Heat Conduction Problems on Regions Partitioned into Rectangles.
A fast Lagrangian heuristic for large-scale capacitated lot-size problems with restricted cost structures
In this paper, we demonstrate the computational consequences of making a simple assumption on production cost structures in capacitated lot-size problems. Our results indicate that our cost assumption of increased productivity over time has dramatic effects on the problem sizes which are solvable. Our experiments indicate that problems with more than 1000 products in more than 1000 time periods may be solved within reasonable time. The Lagrangian decomposition algorithm we use does of course not...
A Fast ' Monte-Carlo Cross-Validation' Procedure for Large Least Squares Problems with Noisy Data.
A fast numerical test of multivariate polynomial positiveness with applications
The paper presents a simple method to check a positiveness of symmetric multivariate polynomials on the unit multi-circle. The method is based on the sampling polynomials using the fast Fourier transform. The algorithm is described and its possible applications are proposed. One of the aims of the paper is to show that presented algorithm is significantly faster than commonly used method based on the semi-definite programming expression.
A fast solver for the first biharmonic boundary value problem.
A Fast Transform for Spherical Harmonics.
A FETI-DP preconditioner for mortar methods in three dimensions.
A fictitious domain method for the numerical two-dimensional simulation of potential flows past sails
This paper deals with the mathematical and numerical analysis of a simplified two-dimensional model for the interaction between the wind and a sail. The wind is modeled as a steady irrotational plane flow past the sail, satisfying the Kutta-Joukowski condition. This condition guarantees that the flow is not singular at the trailing edge of the sail. Although for the present analysis the position of the sail is taken as data, the final aim of this research is to develop tools to compute the sail...
A fictitious domain method for the numerical two-dimensional simulation of potential flows past sails
This paper deals with the mathematical and numerical analysis of a simplified two-dimensional model for the interaction between the wind and a sail. The wind is modeled as a steady irrotational plane flow past the sail, satisfying the Kutta-Joukowski condition. This condition guarantees that the flow is not singular at the trailing edge of the sail. Although for the present analysis the position of the sail is taken as data, the final aim of this research is to develop tools to compute the sail...