Výsledky vyhľadávania - Numerical Algorithms AND Problems—computations on polynomials*

A Subdivision-Based Algorithm for the Sparse Resultant

Autori: John F. Canny Ioannis Z. Emiris The Pennsylvania State University CiteSeerX Archives

Prispievatelia: John F. Canny Ioannis Z. Emiris The Pennsylvania State University CiteSeerX Archives

Zdroj: ftp://ftp-sop.inria.fr/saga/emiris/publis/CEjacm.ps.gz

Predmety: Categories and Subject Descriptors, I.1.2 Algorithms (Algebraic algorithms, Analysis of algorithms). F.2.1 Numerical Algorithms and Problems (Computations on matrices, Computations on polynomials). F.2.2 Nonnumerical Algorithms and Problems (Computations on discrete s, Geometrical problems and computations) General Terms, Algorithms, Theory. Additional Key Words and Phrases, Sparse elimination theory, multivariate resultant, Newton polytope, mixed volume, polyhedral subdivision, eoeective Nullstellensatz, asymptotic complexity

Popis súboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.4733

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.4733

Solving polynomial equations in smoothed polynomial time and a near solution to Smale’s 17th problem

Autori: Peter Bürgisser Felipe Cucker The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Peter Bürgisser Felipe Cucker The Pennsylvania State University CiteSeerX Archives

Zdroj: http://math-www.upb.de/agpb/work/stoc149-buergisser.pdf.

Predmety: Categories and Subject Descriptors F.2.1 [Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems—computations on polynomials, G.1.5 [Numerical Analysis, Roots of Nonlinear Equations—Continuation (homotopy) methods

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.409.744

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.409.744
http://math-www.upb.de/agpb/work/stoc149-buergisser.pdf

Explicit Lower Bounds via Geometric Complexity Theory (Extended Abstract)

Autori: Peter Bürgisser Christian Ikenmeyer The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Peter Bürgisser Christian Ikenmeyer The Pennsylvania State University CiteSeerX Archives

Zdroj: http://math-www.upb.de/agpb/work/arxiv1210.8368v1.pdf.

Predmety: Measures andClasses, F.2.1 [Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems—Computations on polynomials General Terms Algorithms, Theory Keywords geometric complexitytheory, tensorrank, matrixmultiplication, Kronecker coefficients, permanent versus determinant

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.409.779

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.409.779
http://math-www.upb.de/agpb/work/arxiv1210.8368v1.pdf

Division-free computation of subresultants using Bezout matrices.

Autori: Kerber, Michael¹ (AUTHOR) mkerber@mpi-inf.mpg.de

Zdroj: International Journal of Computer Mathematics. Dec2009, Vol. 86 Issue 12, p2186-2200. 15p. 2 Charts.

Predmety: *ALGORITHMS, *POLYNOMIALS, *MATRICES (Mathematics), *DETERMINANTS (Mathematics), *DIOPHANTINE equations

On Lacunary Polynomial Perfect Powers

Autori: Mark Giesbrecht Daniel S: ROche The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Mark Giesbrecht Daniel S: ROche The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.uwaterloo.ca/~mwg/research/files/lacunary-pp.pdf.

Predmety: Categories and Subject Descriptors I.1.2 [Symbolic and Algebraic Manipulation, Algorithms—Algebraic algorithms, Analysis of algorithms, F.2.1 [Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems—Computations on polynomials, Number-theoretic computations General Terms Algorithms Keywords Lacunary polynomial, black box polynomial, sparse polynomial, perfect

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.304.6774

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.304.6774
http://www.cs.uwaterloo.ca/~mwg/research/files/lacunary-pp.pdf

Optimal Complexity Lower Bound for Polynomial Multiplication

Autori: Peter Bürgisser Martin Lotz The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Peter Bürgisser Martin Lotz The Pennsylvania State University CiteSeerX Archives

Zdroj: http://math-www.upb.de/agpb/work/bcbc-fin.pdf.

Predmety: Categories and Subject Descriptors, F.1.1 [Computation by Abstract Devices, Models of Computation, F.2.1 [Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems—Computations on polynomials, I.1.2 [Symbolic and Algebraic Manipulation, Algorithms General Terms, Algorithms, Theory Additional Key Words and Phrases, algebraic complexity, bilinear circuits, cyclic convolution, Fast Fourier Transform, lower bounds, polynomial multiplication, singular values, rigidity

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.409.2091

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.409.2091
http://math-www.upb.de/agpb/work/bcbc-fin.pdf

Kahoui, Algorithms for recognizing coordinates in two variables over UFD’s

Autori: Hassan El Houari M’hammed El Kahoui The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Hassan El Houari M’hammed El Kahoui The Pennsylvania State University CiteSeerX Archives

Zdroj: http://domino.mpi-inf.mpg.de/intranet/ag1/ag1publ.nsf/0/09e211dd8f4e6f84c1256fb30050de55/$file/p51-houari.pdf.

Predmety: I.1.2 [Symbolic and Algebraic Manipulation, Algo- rithms—Algebraic algorithms, F.2.1 [Analysis of Algo- rithms and Problem Complexity, Numerical Algo- rithms and Problems—Computations on polynomials General Terms Algorithms Keywords Co, Locally nilpotent derivation, Slice

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.543.8586

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.543.8586
http://domino.mpi-inf.mpg.de/intranet/ag1/ag1publ.nsf/0/09e211dd8f4e6f84c1256fb30050de55/$file/p51-houari.pdf

Numerical Fourier Analysis

Autori: Gerlind Plonka Daniel Potts Gabriele Steidl a ďalší

Typ zdroja: eBook.

Predmet: Fourier analysis

Kategórie: MATHEMATICS / Mathematical Analysis, MATHEMATICS / Algebra / Linear, MATHEMATICS / Applied, MATHEMATICS / Numerical Analysis

An Algorithm for the Complete Solution of Quadratic Eigenvalue Problems.

Autori: HAMMARLING, SVEN MUNRO, CHRISTOPHER J. TISSEUR, FRANçOISE

Zdroj: ACM Transactions on Mathematical Software; 2013, Vol. 39 Issue 3, p18-18:19, 2p, 2 Charts

Predmety: MATHEMATICAL models, ALGORITHM research, EIGENVALUES, NUMERICAL analysis, MATHEMATICS software, COMPUTER software

On computing the zeros of a class of Sobolev orthogonal polynomials.

Autori: Mastronardi, N. Van Barel, M. Vandebril, R. a ďalší

Zdroj: Numerical Algorithms; Dec2025, Vol. 100 Issue 4, p1765-1781, 17p

Predmety: EIGENVALUES, NUMERICAL roots, EMPIRICAL research, NUMERICAL analysis, LAGUERRE polynomials, ASYMPTOTIC distribution, HYPERGEOMETRIC functions, RECURSIVE sequences (Mathematics)

Computational Strategy for Analyzing Effective Properties of Random Composites—Part II: Elasticity.

Autori: Czapla, Roman Drygaś, Piotr Gluzman, Simon a ďalší

Zdroj: Materials (1996-1944); Nov2025, Vol. 18 Issue 21, p5041, 30p

Predmety: ELASTICITY, COMPOSITE materials, MODULUS of rigidity, NUMERICAL analysis, DISTRIBUTION (Probability theory), QUANTITATIVE research

Physics-informed neural networks (PINNs) as intelligent computing technique for solving partial differential equations: Limitation and future prospects.

Autori: Zhang, Weiwei Suo, Wei Song, Jiahao a ďalší

Zdroj: SCIENCE CHINA Physics, Mechanics & Astronomy; Jan2026, Vol. 69 Issue 1, p1-18, 18p

Numerical Modeling of Photovoltaic Cells with the Meshless Global Radial Basis Function Collocation Method.

Autori: Ispir, Murat Tanbay, Tayfun

Zdroj: Energies (19961073); Oct2025, Vol. 18 Issue 19, p5267, 22p

Predmety: PHOTOVOLTAIC cells, P-N junctions (Semiconductors), MESHFREE methods, MATHEMATICAL optimization, CARRIER density, COMPUTER performance, COMPUTER simulation, RADIAL basis functions

Solving p-adic polynomial systems via iterative eigenvector algorithms.

Autori: Kulkarni, Avinash

Zdroj: Linear & Multilinear Algebra; Mar2022, Vol. 70 Issue 4, p650-671, 22p

Predmety: POLYNOMIALS, EIGENVECTORS, ALGORITHMS, LINEAR algebra, ARITHMETIC, EIGENVALUES

Optimal Branch-Decomposition of Planar Graphs in O(n³) Time.

Autori: QIAN-PING GU HISAO TAMAKI

Zdroj: ACM Transactions on Algorithms; 2008, Vol. 4 Issue 3, p30-30:13, 13p, 2 Diagrams, 2 Charts

Predmety: ALGORITHMS, MATHEMATICAL analysis, NUMERICAL analysis, COMPUTATIONAL mathematics, GRAPH theory, POLYNOMIALS

On the Performance of Physics-Based Neural Networks for Symmetric and Asymmetric Domains: A Comparative Study and Hyperparameter Analysis.

Autori: Brociek, Rafał Pleszczyński, Mariusz Mughal, Dawood Asghar

Zdroj: Symmetry (20738994); Oct2025, Vol. 17 Issue 10, p1698, 29p

Predmety: DIFFERENTIAL equations, INTEGRO-differential equations, VOLTERRA equations, MACHINE learning, BURGERS' equation, SENSITIVITY analysis, POISSON'S equation

Minimizing Compositions of Differences-of-Convex Functions with Smooth Mappings.

Autori: Le Thi, Hoai An Huynh, Van Ngai Dinh, Tao Pham

Zdroj: Mathematics of Operations Research; May2024, Vol. 49 Issue 2, p1140-1168, 29p

Predmety: SMOOTHNESS of functions, DIFFERENTIABLE functions, CONVEX sets

An Approximation Scheme for Stochastic Linear Programming and Its Application to Stochastic Integer Programs.

Autori: Shmoys, David B. Swamy, Chaitanya

Zdroj: Journal of the ACM; Nov2006, Vol. 53 Issue 6, p978-1012, 35p

Predmety: STOCHASTIC analysis, MATHEMATICAL optimization, PROBABILITY theory, LINEAR statistical models, POLYNOMIALS, ALGORITHMS

A new error correction method for the stationary Navier-Stokes equations based on two local Gauss integrations.

Autori: Yang, Yun-Bo Kong, Qiong-Xiang

Zdroj: Applications of Mathematics; Feb2017, Vol. 62 Issue 1, p75-100, 26p

Predmety: ERROR correction (Information theory), STATIONARY processes, NAVIER-Stokes equations, INTEGRALS, ORTHOGONAL polynomials, NUMERICAL analysis

Solving inverse acoustic obstacle scattering problem from phaseless far-field measurement using deep neural network surrogates.

Autori: Fan, Yuxin Hong, Jiho Jin, Bangti

Zdroj: Inverse Problems; Sep2025, Vol. 41 Issue 9, p1-31, 31p

Predmety: ARTIFICIAL neural networks, MARKOV chain Monte Carlo, MEASUREMENT, BAYESIAN analysis, COMPUTER simulation, SCATTERING (Mathematics), SOUND wave scattering