Günter Mayer

29 papers Misc 1Journal 23Unranked 2
YearRankTypeTitle / Venue / Authors
2023 — conf
Complex-Valued Interval Computations are NP-Hard Even for Single Use Expressions.
NAFIPS
Martine Ceberio, Vladik Kreinovich, Olga Kosheleva, Günter Mayer
2012 J jnl
An Oettli-Prager-Like Theorem for the Symmetric Solution Set and for Related Solution Sets.
SIAM J. Matrix Anal. Appl.
Günter Mayer
2012 J jnl
On an Expression for the Midpoint and the Radius of the Product of Two Intervals.
Reliab. Comput.
Günter Mayer
2008 J jnl
New Criteria for the Feasibility of the Cholesky Method with Interval Data.
SIAM J. Matrix Anal. Appl.
Götz Alefeld, Günter Mayer
2006 J jnl
A Contribution to the Feasibility of the Interval Gaussian Algorithm.
Reliab. Comput.
Günter Mayer
2005 Misc conf
Computing the cube of an interval matrix is NP-Hard.
SAC
Olga Kosheleva, Vladik Kreinovich, Günter Mayer, Hung T. Nguyen
2005 J jnl
Enclosing Solutions of Singular Interval Systems Iteratively.
Reliab. Comput.
Götz Alefeld, Günter Mayer
2005 J jnl
New Criteria for the Semiconvergence of Interval Matrices.
SIAM J. Matrix Anal. Appl.
Hans-Robert Arndt, Günter Mayer
2005 J jnl
On the Solutions of the Interval System [
Reliab. Comput.
Hans-Robert Arndt, Günter Mayer
2003 — conf
On Singular Interval Systems.
Numerical Software with Result Verification
Götz Alefeld, Günter Mayer
2001 J jnl
A Comment on the Shape of the Solution Set for Systems of Interval Linear Equations with Dependent Coefficients.
Reliab. Comput.
Götz Alefeld, Vladik Kreinovich, Günter Mayer, Michael Huth
2001 — ch.
Modifications of the Oettli-Prager Theorem with Application to the Eigenvalue Problem.
Symbolic Algebraic Methods and Verification Methods
Götz Alefeld, Vladik Kreinovich, Günter Mayer
2001 — ch.
On the Limit of the Total Step Method in Interval Analysis.
Perspectives on Enclosure Methods
Günter Mayer, Ingo Warnke
2001 — ch.
On the Shape of the Fixed Points of [f]([c])=[A][x]+[b].
Symbolic Algebraic Methods and Verification Methods
Günter Mayer, Ingo Warnke
1998 J jnl
On the Applicability of the Interval Gaussian Algorithm.
Reliab. Comput.
Günter Mayer, Jiri Rohn
1997 J jnl
On a Theoretical Justification of the Choice of Epsilon-Inflation in PASCAL-XSC.
Reliab. Comput.
Vladik Kreinovich, Scott A. Starks, Günter Mayer
1997 J jnl
On the Shape of the Symmetric, Persymmetric, and Skew-Symmetric Solution Set.
SIAM J. Matrix Anal. Appl.
Götz Alefeld, Vladik Kreinovich, Günter Mayer
1996 J jnl
Best student paper award.
Reliab. Comput.
Vladik Kreinovich, Günter Mayer
1996 J jnl
Preface.
Reliab. Comput.
Günter Mayer, Vladik Kreinovich
1995 J jnl
On the Symmetric and Unsymmetric Solution Set of Interval Systems.
SIAM J. Matrix Anal. Appl.
Götz Alefeld, Günter Mayer
1995 J jnl
Towards the future of interval computations - Editors' Introduction to the student issue.
Reliab. Comput.
Vladik Kreinovich, Günter Mayer
1994 J jnl
Numerical validation for an inverse matrix eigenvalue problem.
Computing
Götz Alefeld, A. Gienger, Günter Mayer
1993 J jnl
A New Criterion to Guarantee the Feasibility of the Interval Gaussian Algorithm.
SIAM J. Matrix Anal. Appl.
Andreas Frommer, Günter Mayer
1992 J jnl
On the theory and practice of multisplitting methods in parallel computation.
Computing
Andreas Frommer, Günter Mayer
1992 J jnl
Some remarks on two interval-arithmetic modifications of the newton method.
Computing
Günter Mayer
1990 J jnl
Block colouring schemes for the SOR method on local memory parallel computers.
Parallel Comput.
Uwe Block, Andreas Frommer, Günter Mayer
1990 J jnl
Efficient methods for enclosing solutions of systems of nonlinear equations.
Computing
Andreas Frommer, Günter Mayer
1989 J jnl
Safe bounds for the solutions of nonlinear problems using a parallel multisplitting method.
Computing
Andreas Frommer, Günter Mayer
1985 J jnl
Enclosing the solution set of linear systems with inaccurate data by iterative methods based on incomplete LU-decompositions.
Computing
Günter Mayer