Günter Mayer

According to our database, Günter Mayer authored at least 29 papers between 1985 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Complex-Valued Interval Computations are NP-Hard Even for Single Use Expressions.

Martine Ceberio, Vladik Kreinovich, Olga Kosheleva, Günter Mayer

Proceedings of the Fuzzy Information Processing 2023, 2023

2012

An Oettli-Prager-Like Theorem for the Symmetric Solution Set and for Related Solution Sets.

Günter Mayer

SIAM J. Matrix Anal. Appl., 2012

On an Expression for the Midpoint and the Radius of the Product of Two Intervals.

Günter Mayer

Reliab. Comput., 2012

2008

New Criteria for the Feasibility of the Cholesky Method with Interval Data.

Götz Alefeld, Günter Mayer

SIAM J. Matrix Anal. Appl., 2008

2006

A Contribution to the Feasibility of the Interval Gaussian Algorithm.

Günter Mayer

Reliab. Comput., 2006

2005

New Criteria for the Semiconvergence of Interval Matrices.

Hans-Robert Arndt, Günter Mayer

SIAM J. Matrix Anal. Appl., 2005

On the Solutions of the Interval System [<i>x</i>] = [<i>A][x</i>] + [<i>b</i>].

Hans-Robert Arndt, Günter Mayer

Reliab. Comput., 2005

Enclosing Solutions of Singular Interval Systems Iteratively.

Götz Alefeld, Günter Mayer

Reliab. Comput., 2005

Computing the cube of an interval matrix is NP-Hard.

Olga Kosheleva, Vladik Kreinovich, Günter Mayer, Hung T. Nguyen

Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), 2005

2003

On Singular Interval Systems.

Götz Alefeld, Günter Mayer

Proceedings of the Numerical Software with Result Verification, 2003

2001

A Comment on the Shape of the Solution Set for Systems of Interval Linear Equations with Dependent Coefficients.

Götz Alefeld, Vladik Kreinovich, Günter Mayer, Michael Huth

Reliab. Comput., 2001

On the Shape of the Fixed Points of [f]([c])=[A][x]+[b].

Günter Mayer, Ingo Warnke

Proceedings of the Symbolic Algebraic Methods and Verification Methods, 2001

Modifications of the Oettli-Prager Theorem with Application to the Eigenvalue Problem.

Götz Alefeld, Vladik Kreinovich, Günter Mayer

Proceedings of the Symbolic Algebraic Methods and Verification Methods, 2001

On the Limit of the Total Step Method in Interval Analysis.

Günter Mayer, Ingo Warnke

Proceedings of the Perspectives on Enclosure Methods, 2001

1998

On the Applicability of the Interval Gaussian Algorithm.

Günter Mayer, Jiri Rohn

Reliab. Comput., 1998

1997

On the Shape of the Symmetric, Persymmetric, and Skew-Symmetric Solution Set.

Götz Alefeld, Vladik Kreinovich, Günter Mayer

SIAM J. Matrix Anal. Appl., July, 1997

On a Theoretical Justification of the Choice of Epsilon-Inflation in PASCAL-XSC.

Vladik Kreinovich, Scott A. Starks, Günter Mayer

Reliab. Comput., 1997

1996

Preface.

Günter Mayer, Vladik Kreinovich

Reliab. Comput., 1996

Best student paper award.

Vladik Kreinovich, Günter Mayer

Reliab. Comput., 1996

1995

On the Symmetric and Unsymmetric Solution Set of Interval Systems.

Götz Alefeld, Günter Mayer

SIAM J. Matrix Anal. Appl., 1995

Towards the future of interval computations - Editors' Introduction to the student issue.

Vladik Kreinovich, Günter Mayer

Reliab. Comput., 1995

1994

Numerical validation for an inverse matrix eigenvalue problem.

Götz Alefeld, A. Gienger, Günter Mayer

Computing, 1994

1993

A New Criterion to Guarantee the Feasibility of the Interval Gaussian Algorithm.

Andreas Frommer, Günter Mayer

SIAM J. Matrix Anal. Appl., April, 1993

1992

Some remarks on two interval-arithmetic modifications of the newton method.

Günter Mayer

Computing, 1992

On the theory and practice of multisplitting methods in parallel computation.

Andreas Frommer, Günter Mayer

Computing, 1992

1990

Block colouring schemes for the SOR method on local memory parallel computers.

Uwe Block, Andreas Frommer, Günter Mayer

Parallel Comput., 1990

Efficient methods for enclosing solutions of systems of nonlinear equations.

Andreas Frommer, Günter Mayer

Computing, 1990

1989

Safe bounds for the solutions of nonlinear problems using a parallel multisplitting method.

Andreas Frommer, Günter Mayer

Computing, 1989

1985

Enclosing the solution set of linear systems with inaccurate data by iterative methods based on incomplete LU-decompositions.

Günter Mayer

Computing, 1985