Results 71 to 80 of about 33,431,346 (225)

On converses to the polynomial method

, 2022
13 pages. No changes. This work was largely subsumed by another with one extra author (arXiv:2212.08559)
Briët, Jop, Escudero Gutiérrez, Francisco   +1 more
openaire   +4 more sources

Evaluation of Computing Symmetrical Zolotarev Polynomials of the First Kind [PDF]

Radioengineering, 2017
This report summarize and compares with each other various methods for computing the symmetrical Zolotarev Polynomial of the first kind and its spectrum. Suitable criteria are suggested for the comparison.
J. Kubak, P. Sovka, M. Vlcek
doaj  

A Heuristic Method for Solving Polynomial Matrix Equations

Axioms
We propose a heuristic method to solve polynomial matrix equations of the type ∑k=1makXk=B, where ak are scalar coefficients and X and B are square matrices of order n.
Juan Luis González-Santander, Fernando Sánchez Lasheras   +1 more
doaj   +1 more source

Perancangan dan Implementasi Cyclic Redundancy Check – 16 sebagai Metode Error Checking pada Transmisi Pesan Protokol Modbus Remote Terminal Unit Berbasis Microcontroller Unit

Jurnal Nasional Teknik Elektro, 2016
This paper presents about the Cyclic Redundancy Check – 16, a generator polynomial for error detection, which is normally used in MODBUS Remote Terminal Unit.
Arief Wisnu Wardana, Eka Firmansyah, Addin Suwastono   +2 more
doaj   +1 more source

Polynomial Chaos Expansion of random coefficients and the solution of stochastic partial differential equations in the Tensor Train format

, 2015
We apply the Tensor Train (TT) decomposition to construct the tensor product Polynomial Chaos Expansion (PCE) of a random field, to solve the stochastic elliptic diffusion PDE with the stochastic Galerkin discretization, and to compute some quantities of
Dolgov, Sergey, Khoromskij, Boris N., Litvinenko, Alexander, Matthies, Hermann G.   +3 more
core   +1 more source

Orthogonal polynomials and the Lanczos method [PDF]

Banach Center Publications, 1994
Lanczos method for solving a system of linear equations is well known. It is derived from a generalization of the method of moments and one of its main interests is that it provides the exact answer in at most n steps where n is the dimension of the system. Lanczos method can be implemented via several recursive algorithms known as Orthodir , Orthomin,
Brezinski C., REDIVO ZAGLIA, MICHELA, Sadok H.   +2 more
openaire   +2 more sources

Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction

, 2008
A method for concatenating quantum error-correcting codes is presented. The method is applicable to a wide class of quantum error-correcting codes known as Calderbank-Shor-Steane (CSS) codes.
Hamada, Mitsuru
core   +2 more sources

The kernel polynomial method based on Jacobi polynomials

Applied Mathematics and Computation
The kernel polynomial method based on Jacobi polynomials $P_n^{α,β}(x)$ is proposed. The optimal-resolution positivity-preserving kernels and the corresponding damping factors are obtained. The results provide a generalization of the Jackson damping factors for arbitrary Jacobi polynomials.
I.O. Raikov, Y.M. Beltukov
openaire   +3 more sources

Effect of non-polynomial input to a switching circuit [PDF]

, 2001
In this paper, the validity of the state-space averaging method is analyzed. We assume that the state-space piecewise method is an exact model for a fast switching circuit.
Ling, Wing-Kuen, Tam, Peter Kwong-Shun
core  

Adomian decomposition method with orthogonal polynomials: Legendre polynomials

Mathematical and Computer Modelling, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source