Syzygies for Metropolis base chains

DOI10.1016/j.laa.2010.12.021zbMath1211.60032OpenAlexW2022912816MaRDI QIDQ632467

Ian H. Dinwoodie

Publication date: 25 March 2011

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2010.12.021

zbMATH Keywords

samplingsyzygiesMetropolis algorithmannealing

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Syzygies, resolutions, complexes and commutative rings (13D02)

Uses Software

• SINGULAR
• 4ti2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polynomials for classification trees and applications
• On the complexity of computing syzygies
• Fast projection methods for minimal design problems in linear system theory
• \(n\)D polynomial matrices with applications to multidimensional signal analysis
• Algebraic algorithms for sampling from conditional distributions
• Indicator function and complex coding for mixed fractional factorial designs
• Statistical problems involving permutations with restricted positions
• Monte Carlo strategies in scientific computing
• On syzygy modules for polynomial matrices

This page was built for publication: Syzygies for Metropolis base chains