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.
Grid generation methods / Vladimir D. Liseikin
| Grid generation methods / Vladimir D. Liseikin |
| Autore | Liseikin, Vladimir D. |
| Edizione | [3. ed] |
| Pubbl/distr/stampa | Cham, : Springer, 2017 |
| Descrizione fisica | xx, 530 p. : ill. ; 24 cm |
| Soggetto topico |
65-XX - Numerical analysis [MSC 2020]
65M50 - Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs [MSC 2020] 65N50 - Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs [MSC 2020] |
| Soggetto non controllato |
Adaptive grid
Beltrami equation Christoffel symbols Delaunay triangulation Dirichlet tessellation Drag meshing Finite element methods Grid clustering Hybrid grids Immersed boundary method Inverse matrix method Inverted Beltrami Mesh adaptation Mesh generation Octree decomposition Spectral element algorithm Stretched grid method Structured grids Unstructured grids algebraic grid generation |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Titolo uniforme | |
| Record Nr. | UNICAMPANIA-VAN0187562 |
Liseikin, Vladimir D.
|
||
| Cham, : Springer, 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Grid generation methods / Vladimir D. Liseikin
| Grid generation methods / Vladimir D. Liseikin |
| Autore | Liseikin, Vladimir D. |
| Edizione | [3. ed] |
| Pubbl/distr/stampa | Cham, : Springer, 2017 |
| Descrizione fisica | xx, 530 p. : ill. ; 24 cm |
| Soggetto topico |
65-XX - Numerical analysis [MSC 2020]
65M50 - Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs [MSC 2020] 65N50 - Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs [MSC 2020] |
| Soggetto non controllato |
Adaptive grid
Beltrami equation Christoffel symbols Delaunay triangulation Dirichlet tessellation Drag meshing Finite element methods Grid clustering Hybrid grids Immersed boundary method Inverse matrix method Inverted Beltrami Mesh adaptation Mesh generation Octree decomposition Spectral element algorithm Stretched grid method Structured grids Unstructured grids algebraic grid generation |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Titolo uniforme | |
| Record Nr. | UNICAMPANIA-VAN00187562 |
|
Liseikin, Vladimir D.
|
||
| Cham, : Springer, 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Numerical Geometry, Grid Generation and Scientific Computing : Proceedings of the 10th International Conference, NUMGRID 2020/Delaunay 130, Celebrating the 130th Anniversary of Boris Delaunay, Moscow, Russia, November 2020 / Vladimir A. Garanzha, Lennard Kamenski, Hang Si editors
| Numerical Geometry, Grid Generation and Scientific Computing : Proceedings of the 10th International Conference, NUMGRID 2020/Delaunay 130, Celebrating the 130th Anniversary of Boris Delaunay, Moscow, Russia, November 2020 / Vladimir A. Garanzha, Lennard Kamenski, Hang Si editors |
| Pubbl/distr/stampa | Cham, : Springer, 2021 |
| Descrizione fisica | xx, 417 p. : ill. ; 24 cm |
| Soggetto topico |
00B25 - Proceedings of conferences of miscellaneous specific interest [MSC 2020]
65-XX - Numerical analysis [MSC 2020] |
| Soggetto non controllato |
Delaunay triangulation
Finite Volume Method Iterative solvers Mesh adaptation Mesh generation Numerical Geometry Quasi‐isometric Mapping Variational Principle Voronoi Diagram |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN0275068 |
| Cham, : Springer, 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Numerical Geometry, Grid Generation and Scientific Computing : Proceedings of the 10th International Conference, NUMGRID 2020/Delaunay 130, Celebrating the 130th Anniversary of Boris Delaunay, Moscow, Russia, November 2020 / Vladimir A. Garanzha, Lennard Kamenski, Hang Si editors
| Numerical Geometry, Grid Generation and Scientific Computing : Proceedings of the 10th International Conference, NUMGRID 2020/Delaunay 130, Celebrating the 130th Anniversary of Boris Delaunay, Moscow, Russia, November 2020 / Vladimir A. Garanzha, Lennard Kamenski, Hang Si editors |
| Pubbl/distr/stampa | Cham, : Springer, 2021 |
| Descrizione fisica | xx, 417 p. : ill. ; 24 cm |
| Soggetto topico |
00B25 - Proceedings of conferences of miscellaneous specific interest [MSC 2020]
65-XX - Numerical analysis [MSC 2020] |
| Soggetto non controllato |
Delaunay triangulation
Finite Volume Method Iterative solvers Mesh adaptation Mesh generation Numerical Geometry Quasi‐isometric Mapping Variational Principle Voronoi Diagram |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN00275068 |
| Cham, : Springer, 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
The traveling salesman problem [[electronic resource] ] : a computational study / / David L. Applegate ... [et al.]
| The traveling salesman problem [[electronic resource] ] : a computational study / / David L. Applegate ... [et al.] |
| Autore | Applegate David L |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, : Princeton University Press, c2006 |
| Descrizione fisica | 1 online resource (606 p.) |
| Disciplina | 511.6 |
| Collana | Princeton series in applied mathematics |
| Soggetto topico | Traveling salesman problem |
| Soggetto non controllato |
AT&T Labs
Accuracy and precision Addition Algorithm Analysis of algorithms Applied mathematics Approximation algorithm Approximation Basic solution (linear programming) Best, worst and average case Bifurcation theory Big O notation CPLEX CPU time Calculation Chaos theory Column generation Combinatorial optimization Computation Computational resource Computer Connected component (graph theory) Connectivity (graph theory) Convex hull Cutting-plane method Delaunay triangulation Determinism Disjoint sets Dynamic programming Ear decomposition Engineering Enumeration Equation Estimation Euclidean distance Euclidean space Family of sets For loop Genetic algorithm George Dantzig Georgia Institute of Technology Greedy algorithm Hamiltonian path Hospitality Hypergraph Implementation Instance (computer science) Institute Integer Iteration Linear inequality Linear programming Mathematical optimization Mathematics Model of computation Neuroscience Notation Operations research Optimization problem Order by Pairwise Parameter (computer programming) Parity (mathematics) Percentage Polyhedron Polytope Pricing Princeton University Processing (programming language) Project Quantity Reduced cost Requirement Result Rice University Rutgers University Scientific notation Search algorithm Search tree Self-similarity Simplex algorithm Solution set Solver Source code Special case Stochastic Subroutine Subsequence Subset Summation Test set Theorem Theory Time complexity Trade-off Travelling salesman problem Tree (data structure) Upper and lower bounds Variable (computer science) Variable (mathematics) |
| ISBN |
1-283-25611-8
9786613256119 1-4008-4110-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Contents -- Preface -- Chapter 1. The Problem -- Chapter 2. Applications -- Chapter 3. Dantzig, Fulkerson, and Johnson -- Chapter 4. History of TSP Computation -- Chapter 5. LP Bounds and Cutting Planes -- Chapter 6. Subtour Cuts and PQ-Trees -- Chapter 7. Cuts from Blossoms and Blocks -- Chapter 8. Combs from Consecutive Ones -- Chapter 9. Combs from Dominoes -- Chapter 10. Cut Metamorphoses -- Chapter 11. Local Cuts -- Chapter 12. Managing the Linear Programming Problems -- Chapter 13. The Linear Programming Solver Chapter 14. Branching -- Chapter 14. Branching -- Chapter 15. Tour Finding -- Chapter 16. Computation -- Chapter 17. The Road Goes On -- Bibliography -- Index |
| Record Nr. | UNINA-9910789748903321 |
|
Applegate David L
|
||
| Princeton, : Princeton University Press, c2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The traveling salesman problem : a computational study / / David L. Applegate ... [et al.]
| The traveling salesman problem : a computational study / / David L. Applegate ... [et al.] |
| Autore | Applegate David L |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, : Princeton University Press, c2006 |
| Descrizione fisica | 1 online resource (606 p.) |
| Disciplina | 511.6 |
| Collana | Princeton series in applied mathematics |
| Soggetto topico | Traveling salesman problem |
| Soggetto non controllato |
AT&T Labs
Accuracy and precision Addition Algorithm Analysis of algorithms Applied mathematics Approximation algorithm Approximation Basic solution (linear programming) Best, worst and average case Bifurcation theory Big O notation CPLEX CPU time Calculation Chaos theory Column generation Combinatorial optimization Computation Computational resource Computer Connected component (graph theory) Connectivity (graph theory) Convex hull Cutting-plane method Delaunay triangulation Determinism Disjoint sets Dynamic programming Ear decomposition Engineering Enumeration Equation Estimation Euclidean distance Euclidean space Family of sets For loop Genetic algorithm George Dantzig Georgia Institute of Technology Greedy algorithm Hamiltonian path Hospitality Hypergraph Implementation Instance (computer science) Institute Integer Iteration Linear inequality Linear programming Mathematical optimization Mathematics Model of computation Neuroscience Notation Operations research Optimization problem Order by Pairwise Parameter (computer programming) Parity (mathematics) Percentage Polyhedron Polytope Pricing Princeton University Processing (programming language) Project Quantity Reduced cost Requirement Result Rice University Rutgers University Scientific notation Search algorithm Search tree Self-similarity Simplex algorithm Solution set Solver Source code Special case Stochastic Subroutine Subsequence Subset Summation Test set Theorem Theory Time complexity Trade-off Travelling salesman problem Tree (data structure) Upper and lower bounds Variable (computer science) Variable (mathematics) |
| ISBN |
1-283-25611-8
9786613256119 1-4008-4110-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Contents -- Preface -- Chapter 1. The Problem -- Chapter 2. Applications -- Chapter 3. Dantzig, Fulkerson, and Johnson -- Chapter 4. History of TSP Computation -- Chapter 5. LP Bounds and Cutting Planes -- Chapter 6. Subtour Cuts and PQ-Trees -- Chapter 7. Cuts from Blossoms and Blocks -- Chapter 8. Combs from Consecutive Ones -- Chapter 9. Combs from Dominoes -- Chapter 10. Cut Metamorphoses -- Chapter 11. Local Cuts -- Chapter 12. Managing the Linear Programming Problems -- Chapter 13. The Linear Programming Solver Chapter 14. Branching -- Chapter 14. Branching -- Chapter 15. Tour Finding -- Chapter 16. Computation -- Chapter 17. The Road Goes On -- Bibliography -- Index |
| Record Nr. | UNINA-9910812920303321 |
|
Applegate David L
|
||
| Princeton, : Princeton University Press, c2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||