Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
19th International Symposium on High Performance Computing Systems and Applications : HPCS 2005 : 15-18 mAY 2005, Guelph, Ontario, Canada : proceedings
| 19th International Symposium on High Performance Computing Systems and Applications : HPCS 2005 : 15-18 mAY 2005, Guelph, Ontario, Canada : proceedings |
| Pubbl/distr/stampa | [Place of publication not identified], : IEEE Computer Society, 2005 |
| Disciplina | 004/.35 |
| Soggetto topico |
High performance computing
Engineering & Applied Sciences Computer Science |
| ISBN | 1-5386-0127-3 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996202414703316 |
| [Place of publication not identified], : IEEE Computer Society, 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
19th International Symposium on High Performance Computing Systems and Applications : HPCS 2005 : 15-18 mAY 2005, Guelph, Ontario, Canada : proceedings
| 19th International Symposium on High Performance Computing Systems and Applications : HPCS 2005 : 15-18 mAY 2005, Guelph, Ontario, Canada : proceedings |
| Pubbl/distr/stampa | [Place of publication not identified], : IEEE Computer Society, 2005 |
| Disciplina | 004/.35 |
| Soggetto topico |
High performance computing
Engineering & Applied Sciences Computer Science |
| ISBN | 1-5386-0127-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910146538803321 |
| [Place of publication not identified], : IEEE Computer Society, 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Advances in applied mathematics, modeling, and computational science / / Roderick Melnik, Ilias Kotsireas, editors
| Advances in applied mathematics, modeling, and computational science / / Roderick Melnik, Ilias Kotsireas, editors |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | New York, : Fields Institute for Research in the Mathematical Sciences, : Springer, 2013 |
| Descrizione fisica | 1 online resource (247 p.) |
| Disciplina | 510 |
| Altri autori (Persone) |
MelnikRoderick
KotsireasIlias |
| Collana | Fields Institute communications |
| Soggetto topico |
Mathematics
Computer simulation Mathematical models Computer science Computer science - Mathematics |
| ISBN |
1-283-90974-X
1-4614-5389-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Advances in Applied Mathematics, Modeling, and Computational Science; Preface; Contents; Interconnected Challenges and New Perspectives in Applied Mathematical and Computational Sciences; 1 Mathematical Models and Algorithms; 2 Mathematical Modeling and Computational Experiments; 3 What Is Next; 4 What This Book Is About; 5 Concluding Remarks; References; Dynamic Blocking Problems for a Model of Fire Propagation; 1 Introduction; 1.1 A Model for Fire Propagation; 1.2 Barriers; 1.3 Blocking and Optimization Problems; 2 An Equivalent Formulation; 3 Existence of Blocking Strategies
3.1 The Isotropic Case3.2 The Non-isotropic Case; 4 Existence of Optimal Strategies; 5 Necessary Conditions for Optimality; 5.1 Free Arcs; 5.2 A Single Boundary Arc; 5.3 Several Boundary Arcs Constructed Simultaneously; 5.4 Necessary Conditions at Junctions; 6 Sufficient Conditions for Optimality; 7 Numerical Computation of Optimal Barriers; 8 Open Problems; 8.1 Isotropic Blocking Problem; 8.2 Existence of Optimal Strategies; 8.3 Sufficient Conditions for Optimality; 8.4 Regularity; References Inverse Lax-Wendroff Procedure for Numerical Boundary Conditions of Hyperbolic Equations: Survey and New Developments1 Introduction; 2 Interior Finite Difference Schemes; 3 1D Scalar Conservation Laws; 3.1 Robust and High Order Extrapolation for Outflow Boundary Conditions; 3.2 The ILW Procedure for Inflow Boundary Conditions; 3.3 Computational Results; 4 2D Euler Equations in Static Geometries; 4.1 General Framework; 4.2 No-Penetration Boundary Condition; 4.3 Algorithm Flow Chart; 4.4 Computational Results; 5 2D Euler Equations in Moving Geometries; 6 Concluding Remarks; References Elliptic Curves over Finite Fields: Number Theoretic and Cryptographic Aspects1 Introduction; 1.1 Motivation; 1.2 Arranging a Group Structure on Elliptic Curves; 1.3 General Notation; 1.4 Basic Facts on Elliptic Curves; 2 Structure of Elliptic Curves over Finite Fields; 2.1 Isogeny and Isomorphism Classes in Various Families; 2.2 Finding the Group Structure; 2.3 Groups Represented by Elliptic Curves; 2.4 Exponent; 2.5 Prime Cardinalities; 2.6 Smooth and Easily Factorable Cardinalities; 2.7 Endomorphism Rings; 2.8 Ranks; 3 Cryptographic Applications of Elliptic Curves over Finite Fields 3.1 Embedding Degree3.2 Pairing-Friendly Curves; 3.3 Elliptic Twins; 3.4 Pseudorandom Number Generators and Hash Functions; 4 Concluding Remarks; References; Random Matrix Theory and Its Innovative Applications; 1 Random Matrix Theory in the Press; 2 Famous Laws in RMT with MATLAB Experiments; 2.1 The Most Famous Semi-circle Law; 2.2 Marcenko-Pastur Law (Special Case: Quarter Circle Law); 2.3 Circular Law; 2.4 Tracy-Widom Distribution (Law); 3 Random Matrix Factorization; 3.1 The Chi-Distribution and Orthogonal Invariance; 3.2 The QR Decomposition of randn(n) 3.2.1 Haar Measure on Orthogonal Matrices |
| Record Nr. | UNINA-9910438142403321 |
| New York, : Fields Institute for Research in the Mathematical Sciences, : Springer, 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Analysis of Experimental Algorithms [[electronic resource] ] : Special Event, SEA² 2019, Kalamata, Greece, June 24-29, 2019, Revised Selected Papers / / edited by Ilias Kotsireas, Panos Pardalos, Konstantinos E. Parsopoulos, Dimitris Souravlias, Arsenis Tsokas
| Analysis of Experimental Algorithms [[electronic resource] ] : Special Event, SEA² 2019, Kalamata, Greece, June 24-29, 2019, Revised Selected Papers / / edited by Ilias Kotsireas, Panos Pardalos, Konstantinos E. Parsopoulos, Dimitris Souravlias, Arsenis Tsokas |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XI, 564 p. 462 illus., 125 illus. in color.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Artificial intelligence—Data processing Artificial intelligence Computer graphics Mathematics of Computing Data Science Artificial Intelligence Computer Graphics |
| ISBN | 3-030-34029-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996466423403316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Analysis of Experimental Algorithms : Special Event, SEA² 2019, Kalamata, Greece, June 24-29, 2019, Revised Selected Papers / / edited by Ilias Kotsireas, Panos Pardalos, Konstantinos E. Parsopoulos, Dimitris Souravlias, Arsenis Tsokas
| Analysis of Experimental Algorithms : Special Event, SEA² 2019, Kalamata, Greece, June 24-29, 2019, Revised Selected Papers / / edited by Ilias Kotsireas, Panos Pardalos, Konstantinos E. Parsopoulos, Dimitris Souravlias, Arsenis Tsokas |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XI, 564 p. 462 illus., 125 illus. in color.) |
| Disciplina |
005.1
005.13 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Artificial intelligence—Data processing Artificial intelligence Computer graphics Mathematics of Computing Data Science Artificial Intelligence Computer Graphics |
| ISBN | 3-030-34029-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910357850303321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computer algebra 2006 [[electronic resource] ] : latest advances in symbolic algorithms : proceedings of the Waterloo Workshop in Computer Algebra 2006, Ontario, Canada, 10-12 April 2006 / / editors, Ilias Kotsireas, Eugene Zima
| Computer algebra 2006 [[electronic resource] ] : latest advances in symbolic algorithms : proceedings of the Waterloo Workshop in Computer Algebra 2006, Ontario, Canada, 10-12 April 2006 / / editors, Ilias Kotsireas, Eugene Zima |
| Pubbl/distr/stampa | Singapore ; ; Hackensack, NJ, : World Scientific, c2007 |
| Descrizione fisica | 1 online resource (220 p.) |
| Disciplina | 005.1 |
| Altri autori (Persone) |
KotsireasIlias
ZimaE. V (Evgenii Viktorovich) AbramovS. A |
| Soggetto topico |
Algebra - Data processing
Computer algorithms |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-281-93008-3
9786611930080 981-277-885-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
CONTENTS; Preface; Hypergeometric Summation Revisited S. A. Abramov, M. Petkovsek; 1. Introduction; 2. Validity conditions of the discrete Newton-Leibniz formula; 2.1. A criterion; 2.2. Summation of proper hypergeometric sequences; 2.3. When the interval I contains no leading integer singularity of L; 3. The spaces VI(L) and WI(R(k), L); 3.1. The structure of WI(R(k), L); 3.2. When a rational solution of Gosper's equation is not unique; 3.3. If Gosper's equation has a rational solution R(k) then WI(R, L) = 0; References
Five Applications of Wilf-Zeilberger Theory to Enumeration and Probability M. Apagodu, D. ZeilbergerExplicit Formulas vs. Algorithms; The Holonomic Ansatz; Why this Paper?; The Maple packages AppsWZ and AppsWZmulti; Asymptotics; First Application: Rolling a Die; Second Application: How many ways to have r people chip in to pay a bill of n cents; Third Application: Hidden Markov Models; Fourth Application: Lattice Paths Counting; References; Factoring Systems of Linear Functional Equations Using Eigenrings M. A. Barkatou; 1. Introduction and notations; 2. Preliminaries 3. Eigenrings and reduction of pseudo-linear equationsMaximal Decompsition; 4. Spaces of homomorphisms and factorization; Appendix A. K[X; φ, δ].modules and matrix pseudo-linear equations; Appendix A.1. Pseudo-linear operators; Appendix A.2. Similarity, reducibility, decomposability and complete reducibility; Appendix A.3. The ring of endomorphisms of a pseudo-linear operator; References; Modular Computation for Matrices of Ore Polynomials H. Cheng, G. Labahn; 1. Introduction; 2. Preliminaries; 2.1. Notation; 2.2. Definitions; 2.3. The FFreduce Elimination Algorithm 3. Linear Algebra Formulation4. Reduction to Zp[t][Z]; 4.1. Lucky Homomorphisms; 4.2. Termination; 5. Reduction to Zp; 5.1. Applying Evaluation Homomorphisms and Computation in Zp; 5.2. Lucky Homomorphisms and Termination; 6. Complexity Analysis; 7. Implementation Considerations and Experimental Results; 8. Concluding Remarks; References; Beta-Expansions of Pisot and Salem Numbers K. G. Hare; 1. Introduction and History; 2. Univoque Pisot Numbers; 3. Algorithms and Implementation Issues; 4. Conclusions and Open Questions; References Logarithmic Functional and the Weil Reciprocity Law A. Khovanskii1. Introduction; 1.1. The Weil reciprocity law; 1.2. Topological explanation of the reciprocity law over the field C; 1.3. Multi-dimensional reciprocity laws; 1.4. The logarithmic functional; 1.5. Organization of material; 2. Formulation of the Weil reciprocity law; 3. LB-functional of the pair of complex valued functions of the segment on real variable; 4. LB-functional of the pair of complex valued functions and one-dimensional cycle on real manifold; 5. Topological proof of the Weil reciprocity law 6. Generalized LB-functional |
| Record Nr. | UNINA-9910451136203321 |
| Singapore ; ; Hackensack, NJ, : World Scientific, c2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computer algebra 2006 [[electronic resource] ] : latest advances in symbolic algorithms : proceedings of the Waterloo Workshop in Computer Algebra 2006, Ontario, Canada, 10-12 April 2006 / / editors, Ilias Kotsireas, Eugene Zima
| Computer algebra 2006 [[electronic resource] ] : latest advances in symbolic algorithms : proceedings of the Waterloo Workshop in Computer Algebra 2006, Ontario, Canada, 10-12 April 2006 / / editors, Ilias Kotsireas, Eugene Zima |
| Pubbl/distr/stampa | Singapore ; ; Hackensack, NJ, : World Scientific, c2007 |
| Descrizione fisica | 1 online resource (220 p.) |
| Disciplina | 005.1 |
| Altri autori (Persone) |
KotsireasIlias
ZimaE. V (Evgenii Viktorovich) AbramovS. A |
| Soggetto topico |
Algebra - Data processing
Computer algorithms |
| ISBN |
1-281-93008-3
9786611930080 981-277-885-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
CONTENTS; Preface; Hypergeometric Summation Revisited S. A. Abramov, M. Petkovsek; 1. Introduction; 2. Validity conditions of the discrete Newton-Leibniz formula; 2.1. A criterion; 2.2. Summation of proper hypergeometric sequences; 2.3. When the interval I contains no leading integer singularity of L; 3. The spaces VI(L) and WI(R(k), L); 3.1. The structure of WI(R(k), L); 3.2. When a rational solution of Gosper's equation is not unique; 3.3. If Gosper's equation has a rational solution R(k) then WI(R, L) = 0; References
Five Applications of Wilf-Zeilberger Theory to Enumeration and Probability M. Apagodu, D. ZeilbergerExplicit Formulas vs. Algorithms; The Holonomic Ansatz; Why this Paper?; The Maple packages AppsWZ and AppsWZmulti; Asymptotics; First Application: Rolling a Die; Second Application: How many ways to have r people chip in to pay a bill of n cents; Third Application: Hidden Markov Models; Fourth Application: Lattice Paths Counting; References; Factoring Systems of Linear Functional Equations Using Eigenrings M. A. Barkatou; 1. Introduction and notations; 2. Preliminaries 3. Eigenrings and reduction of pseudo-linear equationsMaximal Decompsition; 4. Spaces of homomorphisms and factorization; Appendix A. K[X; φ, δ].modules and matrix pseudo-linear equations; Appendix A.1. Pseudo-linear operators; Appendix A.2. Similarity, reducibility, decomposability and complete reducibility; Appendix A.3. The ring of endomorphisms of a pseudo-linear operator; References; Modular Computation for Matrices of Ore Polynomials H. Cheng, G. Labahn; 1. Introduction; 2. Preliminaries; 2.1. Notation; 2.2. Definitions; 2.3. The FFreduce Elimination Algorithm 3. Linear Algebra Formulation4. Reduction to Zp[t][Z]; 4.1. Lucky Homomorphisms; 4.2. Termination; 5. Reduction to Zp; 5.1. Applying Evaluation Homomorphisms and Computation in Zp; 5.2. Lucky Homomorphisms and Termination; 6. Complexity Analysis; 7. Implementation Considerations and Experimental Results; 8. Concluding Remarks; References; Beta-Expansions of Pisot and Salem Numbers K. G. Hare; 1. Introduction and History; 2. Univoque Pisot Numbers; 3. Algorithms and Implementation Issues; 4. Conclusions and Open Questions; References Logarithmic Functional and the Weil Reciprocity Law A. Khovanskii1. Introduction; 1.1. The Weil reciprocity law; 1.2. Topological explanation of the reciprocity law over the field C; 1.3. Multi-dimensional reciprocity laws; 1.4. The logarithmic functional; 1.5. Organization of material; 2. Formulation of the Weil reciprocity law; 3. LB-functional of the pair of complex valued functions of the segment on real variable; 4. LB-functional of the pair of complex valued functions and one-dimensional cycle on real manifold; 5. Topological proof of the Weil reciprocity law 6. Generalized LB-functional |
| Record Nr. | UNINA-9910784833703321 |
| Singapore ; ; Hackensack, NJ, : World Scientific, c2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computer algebra 2006 : latest advances in symbolic algorithms : proceedings of the Waterloo Workshop in Computer Algebra 2006, Ontario, Canada, 10-12 April 2006 / / editors, Ilias Kotsireas, Eugene Zima
| Computer algebra 2006 : latest advances in symbolic algorithms : proceedings of the Waterloo Workshop in Computer Algebra 2006, Ontario, Canada, 10-12 April 2006 / / editors, Ilias Kotsireas, Eugene Zima |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Singapore ; ; Hackensack, NJ, : World Scientific, c2007 |
| Descrizione fisica | 1 online resource (220 p.) |
| Disciplina | 005.1 |
| Altri autori (Persone) |
KotsireasIlias
ZimaE. V (Evgenii Viktorovich) AbramovS. A |
| Soggetto topico |
Algebra - Data processing
Computer algorithms |
| ISBN |
1-281-93008-3
9786611930080 981-277-885-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
CONTENTS; Preface; Hypergeometric Summation Revisited S. A. Abramov, M. Petkovsek; 1. Introduction; 2. Validity conditions of the discrete Newton-Leibniz formula; 2.1. A criterion; 2.2. Summation of proper hypergeometric sequences; 2.3. When the interval I contains no leading integer singularity of L; 3. The spaces VI(L) and WI(R(k), L); 3.1. The structure of WI(R(k), L); 3.2. When a rational solution of Gosper's equation is not unique; 3.3. If Gosper's equation has a rational solution R(k) then WI(R, L) = 0; References
Five Applications of Wilf-Zeilberger Theory to Enumeration and Probability M. Apagodu, D. ZeilbergerExplicit Formulas vs. Algorithms; The Holonomic Ansatz; Why this Paper?; The Maple packages AppsWZ and AppsWZmulti; Asymptotics; First Application: Rolling a Die; Second Application: How many ways to have r people chip in to pay a bill of n cents; Third Application: Hidden Markov Models; Fourth Application: Lattice Paths Counting; References; Factoring Systems of Linear Functional Equations Using Eigenrings M. A. Barkatou; 1. Introduction and notations; 2. Preliminaries 3. Eigenrings and reduction of pseudo-linear equationsMaximal Decompsition; 4. Spaces of homomorphisms and factorization; Appendix A. K[X; φ, δ].modules and matrix pseudo-linear equations; Appendix A.1. Pseudo-linear operators; Appendix A.2. Similarity, reducibility, decomposability and complete reducibility; Appendix A.3. The ring of endomorphisms of a pseudo-linear operator; References; Modular Computation for Matrices of Ore Polynomials H. Cheng, G. Labahn; 1. Introduction; 2. Preliminaries; 2.1. Notation; 2.2. Definitions; 2.3. The FFreduce Elimination Algorithm 3. Linear Algebra Formulation4. Reduction to Zp[t][Z]; 4.1. Lucky Homomorphisms; 4.2. Termination; 5. Reduction to Zp; 5.1. Applying Evaluation Homomorphisms and Computation in Zp; 5.2. Lucky Homomorphisms and Termination; 6. Complexity Analysis; 7. Implementation Considerations and Experimental Results; 8. Concluding Remarks; References; Beta-Expansions of Pisot and Salem Numbers K. G. Hare; 1. Introduction and History; 2. Univoque Pisot Numbers; 3. Algorithms and Implementation Issues; 4. Conclusions and Open Questions; References Logarithmic Functional and the Weil Reciprocity Law A. Khovanskii1. Introduction; 1.1. The Weil reciprocity law; 1.2. Topological explanation of the reciprocity law over the field C; 1.3. Multi-dimensional reciprocity laws; 1.4. The logarithmic functional; 1.5. Organization of material; 2. Formulation of the Weil reciprocity law; 3. LB-functional of the pair of complex valued functions of the segment on real variable; 4. LB-functional of the pair of complex valued functions and one-dimensional cycle on real manifold; 5. Topological proof of the Weil reciprocity law 6. Generalized LB-functional |
| Record Nr. | UNINA-9910807032003321 |
| Singapore ; ; Hackensack, NJ, : World Scientific, c2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computer Algebra in Scientific Computing [[electronic resource] ] : 25th International Workshop, CASC 2023, Havana, Cuba, August 28 – September 1, 2023, Proceedings / / edited by François Boulier, Matthew England, Ilias Kotsireas, Timur M. Sadykov, Evgenii V. Vorozhtsov
| Computer Algebra in Scientific Computing [[electronic resource] ] : 25th International Workshop, CASC 2023, Havana, Cuba, August 28 – September 1, 2023, Proceedings / / edited by François Boulier, Matthew England, Ilias Kotsireas, Timur M. Sadykov, Evgenii V. Vorozhtsov |
| Autore | Boulier François |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (441 pages) |
| Disciplina | 005.13 |
| Altri autori (Persone) |
EnglandMatthew
KotsireasIlias SadykovTimur M VorozhtsovEvgenii V |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Algorithms
Artificial intelligence Computer science - Mathematics Computer networks Design and Analysis of Algorithms Artificial Intelligence Mathematics of Computing Computer Communication Networks |
| ISBN | 3-031-41724-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Computing GCDs of Multivariate Polynomials over Algebraic Number Fields Presented with Multiple Extensions -- Generating Elementary Integrable Expressions -- How to Automatise Proofs of Operator Statements: Moore–Penrose Inverse a Case Study -- A Modular Algorithm for Computing the Intersection of a One-Dimensional Quasi-Component and a Hypersurface -- Certified Study of Internal Solitary Waves -- Root-Squaring for Root-Finding -- Symbolic-Numerical Algorithm for Solving the Problem of Heavy Ion Collisions in an Optical Model with a Complex Potential -- On the Complexity of Linear Algebra Operations over Algebraic Extension Fields -- Range Functions of Any Convergence Order and their Amortized Complexity Analysis -- Stability and Zero-Hopf Bifurcation Analysis of the Lorenz–Stenflo System Using Symbolic Methods -- Non-Principal Branches of Lambert W. A Tale of 2 circles -- On the Qualitative Analysis of the Equations of Motion of a Nonholonomic Mechanical System -- Solving Parametric Linear Systems Using Sparse Rational Function Interpolation -- On the Distance to the Nearest Defective Matrix -- Effective Algorithm for Computing Noetherian Operators of Positive Dimensional Ideals -- On the Structure and Generators of Differential Invariant Algebras -- An Algorithm for the Intersection Problem of Planar Parametric Curves -- A Symbolic-numeric Method for Solving the Poisson Equation in Polar Coordinates -- Two Variants of B´ezout Subresultants for Several Univariate Polynomials -- Efficient Quotients of Non-Commutative Polynomials -- Inverse Kinematics and Path Planning of Manipulator Using Real Quantifier Elimination Based on Comprehensive Gröbner Systems. |
| Record Nr. | UNISA-996546850803316 |
Boulier François
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computer Algebra in Scientific Computing : 25th International Workshop, CASC 2023, Havana, Cuba, August 28 – September 1, 2023, Proceedings / / edited by François Boulier, Matthew England, Ilias Kotsireas, Timur M. Sadykov, Evgenii V. Vorozhtsov
| Computer Algebra in Scientific Computing : 25th International Workshop, CASC 2023, Havana, Cuba, August 28 – September 1, 2023, Proceedings / / edited by François Boulier, Matthew England, Ilias Kotsireas, Timur M. Sadykov, Evgenii V. Vorozhtsov |
| Autore | Boulier François |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (441 pages) |
| Disciplina | 005.13 |
| Altri autori (Persone) |
EnglandMatthew
KotsireasIlias SadykovTimur M VorozhtsovEvgenii V |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Algorithms
Artificial intelligence Computer science - Mathematics Computer networks Design and Analysis of Algorithms Artificial Intelligence Mathematics of Computing Computer Communication Networks |
| ISBN | 3-031-41724-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Computing GCDs of Multivariate Polynomials over Algebraic Number Fields Presented with Multiple Extensions -- Generating Elementary Integrable Expressions -- How to Automatise Proofs of Operator Statements: Moore–Penrose Inverse a Case Study -- A Modular Algorithm for Computing the Intersection of a One-Dimensional Quasi-Component and a Hypersurface -- Certified Study of Internal Solitary Waves -- Root-Squaring for Root-Finding -- Symbolic-Numerical Algorithm for Solving the Problem of Heavy Ion Collisions in an Optical Model with a Complex Potential -- On the Complexity of Linear Algebra Operations over Algebraic Extension Fields -- Range Functions of Any Convergence Order and their Amortized Complexity Analysis -- Stability and Zero-Hopf Bifurcation Analysis of the Lorenz–Stenflo System Using Symbolic Methods -- Non-Principal Branches of Lambert W. A Tale of 2 circles -- On the Qualitative Analysis of the Equations of Motion of a Nonholonomic Mechanical System -- Solving Parametric Linear Systems Using Sparse Rational Function Interpolation -- On the Distance to the Nearest Defective Matrix -- Effective Algorithm for Computing Noetherian Operators of Positive Dimensional Ideals -- On the Structure and Generators of Differential Invariant Algebras -- An Algorithm for the Intersection Problem of Planar Parametric Curves -- A Symbolic-numeric Method for Solving the Poisson Equation in Polar Coordinates -- Two Variants of B´ezout Subresultants for Several Univariate Polynomials -- Efficient Quotients of Non-Commutative Polynomials -- Inverse Kinematics and Path Planning of Manipulator Using Real Quantifier Elimination Based on Comprehensive Gröbner Systems. |
| Record Nr. | UNINA-9910742490403321 |
|
Boulier François
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
