Suchergebnisse - Numerical Algorithms AND Problems—Computations on polynomials*

Treffer weiter einschränken
  1. 1

    A Subdivision-Based Algorithm for the Sparse Resultant

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

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

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

    Schlagwörter: 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

    Dateibeschreibung: application/postscript

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

    Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.4733

    View record from BASE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  2. 2

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

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

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

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

    Schlagwörter: 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

    Dateibeschreibung: application/pdf

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

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

    View record from BASE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  3. 3

    Explicit Lower Bounds via Geometric Complexity Theory (Extended Abstract)

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

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

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

    Schlagwörter: 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

    Dateibeschreibung: application/pdf

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

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

    View record from BASE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  4. 4

    Division-free computation of subresultants using Bezout matrices.

    Autoren: Kerber, Michael1 (AUTHOR) mkerber@mpi-inf.mpg.de

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

    Schlagwörter: *ALGORITHMS, *POLYNOMIALS, *MATRICES (Mathematics), *DETERMINANTS (Mathematics), *DIOPHANTINE equations

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  5. 5

    On Lacunary Polynomial Perfect Powers

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

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

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

    Schlagwörter: 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

    Dateibeschreibung: application/pdf

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

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

    View record from BASE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  6. 6

    Optimal Complexity Lower Bound for Polynomial Multiplication

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

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

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

    Schlagwörter: 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

    Dateibeschreibung: application/pdf

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

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

    View record from BASE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  7. 7

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

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

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

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

    Schlagwörter: 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

    Dateibeschreibung: application/pdf

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

    Verfügbarkeit: 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

    View record from BASE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  8. 8

    Numerical Fourier Analysis

    Autoren: Gerlind Plonka Daniel Potts Gabriele Steidl et al.

    Resource Type: eBook.

    Schlagworte: Fourier analysis

    Categories: MATHEMATICS / Mathematical Analysis, MATHEMATICS / Algebra / Linear, MATHEMATICS / Applied, MATHEMATICS / Numerical Analysis

    Zu den Favoriten
  9. 9

    An Algorithm for the Complete Solution of Quadratic Eigenvalue Problems.

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

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

    Schlagwörter: MATHEMATICAL models, ALGORITHM research, EIGENVALUES, NUMERICAL analysis, MATHEMATICS software, COMPUTER software

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  10. 10

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

    Autoren: Mastronardi, N. Van Barel, M. Vandebril, R. et al.

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

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

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  11. 11

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

    Autoren: Czapla, Roman Drygaś, Piotr Gluzman, Simon et al.

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

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

    Full Text Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  12. 12

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

    Autoren: Zhang, Weiwei Suo, Wei Song, Jiahao et al.

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

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  13. 13

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

    Autoren: Ispir, Murat Tanbay, Tayfun

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

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

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  14. 14

    Solving p-adic polynomial systems via iterative eigenvector algorithms.

    Autoren: Kulkarni, Avinash

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

    Schlagwörter: POLYNOMIALS, EIGENVECTORS, ALGORITHMS, LINEAR algebra, ARITHMETIC, EIGENVALUES

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  15. 15

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

    Autoren: QIAN-PING GU HISAO TAMAKI

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

    Schlagwörter: ALGORITHMS, MATHEMATICAL analysis, NUMERICAL analysis, COMPUTATIONAL mathematics, GRAPH theory, POLYNOMIALS

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  16. 16

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

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

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

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

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  17. 17

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

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

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

    Schlagwörter: SMOOTHNESS of functions, DIFFERENTIABLE functions, CONVEX sets

    Nájsť tento článok vo Web of Science
    Zu den Favoriten
  18. 18

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

    Autoren: Shmoys, David B. Swamy, Chaitanya

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

    Schlagwörter: STOCHASTIC analysis, MATHEMATICAL optimization, PROBABILITY theory, LINEAR statistical models, POLYNOMIALS, ALGORITHMS

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  19. 19

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

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

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

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

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  20. 20

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

    Autoren: Fan, Yuxin Hong, Jiho Jin, Bangti

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

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

    Nájsť tento článok vo Web of Science
    Zu den Favoriten

Suchwerkzeuge: