Results 201 to 210 of about 770,509 (245)
Some of the next articles are maybe not open access.
Adaptive Chebyshev Iteration Based on Modified Moments
1993The problem of solving a linear system of equations $$Ax = b\quad A \in {\mathbb{R}^{N \times N}},\quad x,b \in {\mathbb{R}^N}$$ (1) , with a large, sparse and nonsymmetric matrix A arises in many applications. A Chebyshev iterative method based on scaled Chebyshev polynomials p n for an interval in the complex plane can be used to solve (1 ...
D. Calvetti, G. H. Golub, L. Reichel
openaire +1 more source
Optimal Approximation of the 1/x Function using Chebyshev Polynomials and Magic Constants
ACM Transactions on Mathematical SoftwareIn this article we analyze low-cost accurate approximation of the function \(1/x\) using Chebyshev polynomials of the first kind and minimizing number of elementary operations in computer codes (in particular, by using the so-called magic constants).
C. Walczyk +3 more
semanticscholar +1 more source
Revisiting fixed-point quantum search: proof of the quasi-Chebyshev lemma
The original Grover's algorithm suffers from the souffle problem, which means that the success probability of quantum search decreases dramatically if the iteration time is too small or too large from the right time.
Guanzhong Li, Shiguang Feng, Lvzhou Li
semanticscholar +1 more source
Modified Chebyshev-Picard Iteration Methods for Orbit Propagation
The Journal of the Astronautical Sciences, 2011Modified Chebyshev-Picard Iteration methods are presented for solving high precision, long-term orbit propagation problems. Fusing Chebyshev polynomials with the classical Picard iteration method, the proposed methods iteratively refine an orthogonal function approximation of the entire state trajectory, in contrast to traditional, step-wise, forward ...
Xiaoli Bai, John L. Junkins
openaire +1 more source
An Iterative Chebyshev Approximation Method for Network Design
IEEE Transactions on Circuit Theory, 1968One of the most important problems of computeraided network design is the optimization of network characteristics by iterative calculation. In this paper, the problem of realizing a network whose transmission characteristics approximate a given function in Chebyshev sense is treated as a nonlinear programming problem, and a method of solving this ...
Y. Ishizaki, H. Watanabe
openaire +1 more source
On Chebyshev accelerated iteration methods for two-by-two block linear systems
Journal of Computational and Applied Mathematics, 2021Zhao-Zheng Liang, Guo‐Feng Zhang
semanticscholar +1 more source
Iterative Chebyshev Polynomial Algorithm for Signal Denoising on Graphs
2019 13th International conference on Sampling Theory and Applications (SampTA), 2019In this paper, we consider the inverse graph filtering process when the original filter is a polynomial of some graph shift on a simple connected graph. The Chebyshev polynomial approximation of high order has been widely used to approximate the inverse filter.
Cheng Cheng +3 more
openaire +1 more source
Chebyshev filtering Lanczos' process in the subspace iteration method
International Journal for Numerical Methods in Engineering, 1984AbstractBathe's basic algorithm of subspace iteration for the solution of the symmetric eigenvalue problem is improved by including a Chebyshev filtering mechanism. To obtain satisfactory convergence for the largest eigenvalues, a shifting strategy is adopted. The shift factor is approximately computed by the Lanczos process.
openaire +2 more sources