Combining partial Jacobian computation and preconditioning: New heuristics, educational modules, and applications - Couverture souple
Résultats de recherche pour Combining partial Jacobian computation and preconditioning:...
Image fournie par le vendeur
Combining partial Jacobian computation and preconditioning: New heuristics, educational modules, and applications
impression à la demandeVendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Solving problems originating from real-world applications is often based on the solution of a system of linear equations whose coefficient matrix is a large sparse Jacobian matrix. Hence, there is research to exploit the sparsity structure and to decrease the amount of storage. In contrast to full Jacobian computation in which all nonzero elements are to be determined, partial Jacobian computation is looking at a subset of these elements. Partial Jacobian computation can therefore be faster and more efficient than full Jacobian computation. Since Jacobian matrix-vector products are needed in iterative solvers, these types of linear systems can be efficiently solved using automatic differentiation. Determining these nonzero elements in full or partial Jacobian computations by automatic differentiation techniques can be modeled as graph coloring in the language of graph theory. On the other hand, preconditioning techniques are used to improve the convergence of iterative solvers and typically need access to all nonzero elements of the Jacobian matrix. So, a sparsification is applied to the Jacobian matrix before computing the preconditioner. In the second part of this thesis, we introduce a collection of interactive educational modules to teach not only graph coloring, but also other concepts from combinatorial scientific computing in the classroom. These modules are designed to involve the students more thoroughly in the process of learning. 104 pp. Deutsch. N° de réf. du vendeur 9783736996366
Acheter neuf
EUR 32,60
Expédition à EUR 23
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Combining partial Jacobian computation and preconditioning: New heuristics, educational modules, and applications
Edité par
Jentzsch-Cuvillier, Annette, 2017
ISBN 10 : 3736996365
ISBN 13 : 9783736996366
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. KlappentextrnrnSolving problems originating from real-world applications is often based on the solution of a system of linear equations whose coefficient matrix is a large sparse Jacobian matrix. Hence, there is research to exploit the sparsity . N° de réf. du vendeur 193776928
Acheter neuf
EUR 32,60
Expédition à EUR 48,99
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Combining partial Jacobian computation and preconditioning: New heuristics, educational modules, and applications
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Neuware -Solving problems originating from real-world applications is often based on the solution of a system of linear equations whose coefficient matrix is a large sparse Jacobian matrix. Hence, there is research to exploit the sparsity structure and to decrease the amount of storage. In contrast to full Jacobian computation in which all nonzero elements are to be determined, partial Jacobian computation is looking at a subset of these elements. Partial Jacobian computation can therefore be faster and more efficient than full Jacobian computation. Since Jacobian matrix-vector products are needed in iterative solvers, these types of linear systems can be efficiently solved using automatic differentiation. Determining these nonzero elements in full or partial Jacobian computations by automatic differentiation techniques can be modeled as graph coloring in the language of graph theory. On the other hand, preconditioning techniques are used to improve the convergence of iterative solvers and typically need access to all nonzero elements of the Jacobian matrix. So, a sparsification is applied to the Jacobian matrix before computing the preconditioner. In the second part of this thesis, we introduce a collection of interactive educational modules to teach not only graph coloring, but also other concepts from combinatorial scientific computing in the classroom. These modules are designed to involve the students more thoroughly in the process of learning.Books on Demand GmbH, Überseering 33, 22297 Hamburg 104 pp. Deutsch. N° de réf. du vendeur 9783736996366
Acheter neuf
EUR 32,60
Expédition à EUR 60
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Combining partial Jacobian computation and preconditioning: New heuristics, educational modules, and applications
impression à la demandeVendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Solving problems originating from real-world applications is often based on the solution of a system of linear equations whose coefficient matrix is a large sparse Jacobian matrix. Hence, there is research to exploit the sparsity structure and to decrease the amount of storage. In contrast to full Jacobian computation in which all nonzero elements are to be determined, partial Jacobian computation is looking at a subset of these elements. Partial Jacobian computation can therefore be faster and more efficient than full Jacobian computation. Since Jacobian matrix-vector products are needed in iterative solvers, these types of linear systems can be efficiently solved using automatic differentiation. Determining these nonzero elements in full or partial Jacobian computations by automatic differentiation techniques can be modeled as graph coloring in the language of graph theory. On the other hand, preconditioning techniques are used to improve the convergence of iterative solvers and typically need access to all nonzero elements of the Jacobian matrix. So, a sparsification is applied to the Jacobian matrix before computing the preconditioner. In the second part of this thesis, we introduce a collection of interactive educational modules to teach not only graph coloring, but also other concepts from combinatorial scientific computing in the classroom. These modules are designed to involve the students more thoroughly in the process of learning. N° de réf. du vendeur 9783736996366
Acheter neuf
EUR 32,60
Expédition à EUR 60,74
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Combining partial Jacobian computation and preconditioning: New heuristics, educational modules, and applications
impression à la demandeVendeur : preigu, Osnabrück, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Combining partial Jacobian computation and preconditioning: New heuristics, educational modules, and applications | Mohammad Ali Rostami | Taschenbuch | 104 S. | Deutsch | 2017 | Cuvillier | EAN 9783736996366 | Verantwortliche Person für die EU: Cuvillier Verlag, Nonnenstieg 8, 37075 Göttingen, info[at]cuvillier[dot]de | Anbieter: preigu Print on Demand. N° de réf. du vendeur 110622778
Acheter neuf
EUR 32,60
Expédition à EUR 70
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 5 disponible(s)