MESHPART

swMATH4178MaRDI QIDQ16362FDOQ16362

Author name not available (Why is that?)

Official website: http://www.cerfacs.fr/algor/Softs/MESHPART/

Cited In (65)

• Title not available (Why is that?)
• A dynamic diffusion optimization method for irregular finite element graph partitioning
• An efficient approach for large scale graph partitioning
• Multilevel refinement for combinatorial optimisation problems
• An Iterative Method for Solving Complex-Symmetric Systems Arising in Electrical Power Modeling
• An overview of graph covering and partitioning
• Geometric Mesh Partitioning: Implementation and Experiments
• Title not available (Why is that?)
• APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS
• Graph Partitioning and Continuous Quadratic Programming
• A knowledge discovery methodology for the performance evaluation of scientific software
• Two improved algorithms for envelope and wavefront reduction
• Approximate centerpoints with proofs
• Separators for sphere-packings and nearest neighbor graphs
• Network essence: PageRank completion and centrality-conforming Markov chains
• Hierarchical Cholesky decomposition of sparse matrices arising from curl–curl-equation
• A Matrix Partitioning Interface to PaToH in MATLAB
• Title not available (Why is that?)
• Combinatorial aspects of geometric graphs
• Title not available (Why is that?)
• Efficient structured multifrontal factorization for general large sparse matrices
• Fast equi-partitioning of rectangular domains using stripe decomposition
• The influence of random number generators on graph partitioning algorithms
• A mesh partitioning algorithm for preserving spatial locality in arbitrary geometries
• Distributed Sparse Gaussian Elimination and Orthogonal Factorization
• Provably Good Partitioning and Load Balancing Algorithms for Parallel Adaptive N-Body Simulation
• Title not available (Why is that?)
• Isoperimetric Partitioning: A New Algorithm for Graph Partitioning
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• DATA GENERATION FOR GEOMETRIC ALGORITHMS ON NON-UNIFORM DISTRIBUTIONS
• Blossom IV
• PGAPack
• JOSTLE
• Dynamic load balancing in computational mechanics
• Chaco
• PaToH
• NAPACK
• cgLanczos
• Artificial Evolution
• SUMO
• PARTY
• TOP/DOMDEC
• OHSUMED
• WebACE
• Metric uniformization and spectral bounds for graphs
• Fast Nested Dissection for Finite Element Meshes
• Title not available (Why is that?)
• On spectral bounds for the \(k\)-partitioning of graphs
• An approximation algorithm for graph partitioning via deterministic annealing neural network
• Title not available (Why is that?)
• Airspace sectorization with constraints
• COMBINING HELPFUL SETS AND PARALLEL SIMULATED ANNEALING FOR THE GRAPH-PARTITIONING PROBLEM∗
• 2D and 3D finite element meshing and remeshing. A bibliography (1990-2001)
• An exact algorithm for graph partitioning
• A massively parallel explicit solver for elasto-dynamic problems exploiting octree meshes
• A mixed heuristic for circuit partitioning
• Discrete calculus. Applied analysis on graphs for computational science
• Title not available (Why is that?)
• Title not available (Why is that?)
• On computing inverse entries of a sparse matrix in an out-of-core environment
• Fast matrix computations for pairwise and columnwise commute times and Katz scores
• Minimum-perimeter domain assignment
• Adding layers to bumped-body polyforms with minimum perimeter preserves minimum perim\-eter
• A prefix code matching parallel load-balancing method for solution-adaptive unstructured finite element graphs on distributed memory multicomputers
• Schur Complement Systems in the Mixed-Hybrid Finite Element Approximation of the Potential Fluid Flow Problem

This page was built for software: MESHPART