IterativeLinearSolverEvent.java

  1. /*
  2.  * Licensed to the Apache Software Foundation (ASF) under one or more
  3.  * contributor license agreements.  See the NOTICE file distributed with
  4.  * this work for additional information regarding copyright ownership.
  5.  * The ASF licenses this file to You under the Apache License, Version 2.0
  6.  * (the "License"); you may not use this file except in compliance with
  7.  * the License.  You may obtain a copy of the License at
  8.  *
  9.  *      https://www.apache.org/licenses/LICENSE-2.0
  10.  *
  11.  * Unless required by applicable law or agreed to in writing, software
  12.  * distributed under the License is distributed on an "AS IS" BASIS,
  13.  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  14.  * See the License for the specific language governing permissions and
  15.  * limitations under the License.
  16.  */

  17. /*
  18.  * This is not the original file distributed by the Apache Software Foundation
  19.  * It has been modified by the Hipparchus project
  20.  */
  21. package org.hipparchus.linear;

  22. import org.hipparchus.exception.LocalizedCoreFormats;
  23. import org.hipparchus.exception.MathRuntimeException;
  24. import org.hipparchus.util.IterationEvent;

  25. /**
  26.  * This is the base class for all events occurring during the iterations of a
  27.  * {@link IterativeLinearSolver}.
  28.  *
  29.  */
  30. public abstract class IterativeLinearSolverEvent
  31.     extends IterationEvent {
  32.     /** Serialization identifier. */
  33.     private static final long serialVersionUID = 20120129L;

  34.     /**
  35.      * Creates a new instance of this class.
  36.      *
  37.      * @param source the iterative algorithm on which the event initially
  38.      * occurred
  39.      * @param iterations the number of iterations performed at the time
  40.      * {@code this} event is created
  41.      */
  42.     protected IterativeLinearSolverEvent(final Object source, final int iterations) {
  43.         super(source, iterations);
  44.     }

  45.     /**
  46.      * Returns the current right-hand side of the linear system to be solved.
  47.      * This method should return an unmodifiable view, or a deep copy of the
  48.      * actual right-hand side vector, in order not to compromise subsequent
  49.      * iterations of the source {@link IterativeLinearSolver}.
  50.      *
  51.      * @return the right-hand side vector, b
  52.      */
  53.     public abstract RealVector getRightHandSideVector();

  54.     /**
  55.      * Returns the norm of the residual. The returned value is not required to
  56.      * be <em>exact</em>. Instead, the norm of the so-called <em>updated</em>
  57.      * residual (if available) should be returned. For example, the
  58.      * {@link ConjugateGradient conjugate gradient} method computes a sequence
  59.      * of residuals, the norm of which is cheap to compute. However, due to
  60.      * accumulation of round-off errors, this residual might differ from the
  61.      * true residual after some iterations. See e.g. A. Greenbaum and
  62.      * Z. Strakos, <em>Predicting the Behavior of Finite Precision Lanzos and
  63.      * Conjugate Gradient Computations</em>, Technical Report 538, Department of
  64.      * Computer Science, New York University, 1991 (available
  65.      * <a href="http://www.archive.org/details/predictingbehavi00gree">here</a>).
  66.      *
  67.      * @return the norm of the residual, ||r||
  68.      */
  69.     public abstract double getNormOfResidual();

  70.     /**
  71.      * <p>
  72.      * Returns the residual. This is an optional operation, as all iterative
  73.      * linear solvers do not provide cheap estimate of the updated residual
  74.      * vector, in which case
  75.      * </p>
  76.      * <ul>
  77.      * <li>this method should throw a
  78.      * {@link MathRuntimeException},</li>
  79.      * <li>{@link #providesResidual()} returns {@code false}.</li>
  80.      * </ul>
  81.      * <p>
  82.      * The default implementation throws a
  83.      * {@link MathRuntimeException}. If this method is overriden,
  84.      * then {@link #providesResidual()} should be overriden as well.
  85.      * </p>
  86.      *
  87.      * @return the updated residual, r
  88.      */
  89.     public RealVector getResidual() {
  90.         throw new MathRuntimeException(LocalizedCoreFormats.UNSUPPORTED_OPERATION);
  91.     }

  92.     /**
  93.      * Returns the current estimate of the solution to the linear system to be
  94.      * solved. This method should return an unmodifiable view, or a deep copy of
  95.      * the actual current solution, in order not to compromise subsequent
  96.      * iterations of the source {@link IterativeLinearSolver}.
  97.      *
  98.      * @return the solution, x
  99.      */
  100.     public abstract RealVector getSolution();

  101.     /**
  102.      * Returns {@code true} if {@link #getResidual()} is supported. The default
  103.      * implementation returns {@code false}.
  104.      *
  105.      * @return {@code false} if {@link #getResidual()} throws a
  106.      * {@link MathRuntimeException}
  107.      */
  108.     public boolean providesResidual() {
  109.         return false;
  110.     }
  111. }