Extreme Optimization™: Complexity made simple.

Numerical Components
for .NET
  • Home
  • Features
    • Math Library
    • Vector and Matrix Library
    • Statistics Library
    • Performance
    • Usability
  • Documentation
    • Introduction
    • Math Library User's Guide
    • Vector and Matrix Library User's Guide
    • Statistics Library User's Guide
    • Reference
  • Resources
    • Downloads
    • QuickStart Samples
    • Sample Applications
    • Frequently Asked Questions
    • Technical Support
  • Blog
  • Order
  • Company
    • About us
    • Testimonials
    • Customers
    • Press Releases
    • Careers
    • Contact us
Introduction
Deployment Guide
Using Parallelism
Expand Mathematics Library User's GuideMathematics Library User's Guide
Expand Vector and Matrix Library User's GuideVector and Matrix Library User's Guide
Expand Statistics Library User's GuideStatistics Library User's Guide
Expand ReferenceReference
  • Home
    • Features
    • Solutions
    • Documentation
    • QuickStart Samples
    • Sample Applications
    • Downloads
    • Technical Support
    • Download trial
    • How to buy
    • Blog
    • Company
    • Resources
  • Documentation
    • Introduction
    • Deployment Guide
    • Using Parallelism
    • Mathematics Library User's Guide
    • Vector and Matrix Library User's Guide
    • Statistics Library User's Guide
    • Reference
  • Reference
    • Extreme.Mathematics Namespace
    • Extreme.Mathematics.Algorithms Namespace
    • Extreme.Mathematics.Calculus Namespace
    • Extreme.Mathematics.Calculus.OrdinaryDifferentialEquations Namespace
    • Extreme.Mathematics.Curves Namespace
    • Extreme.Mathematics.Curves.Nonlinear Namespace
    • Extreme.Mathematics.EquationSolvers Namespace
    • Extreme.Mathematics.Generic Namespace
    • Extreme.Mathematics.Generic.LinearAlgebra Namespace
    • Extreme.Mathematics.Generic.LinearAlgebra.Providers Namespace
    • Extreme.Mathematics.LinearAlgebra Namespace
    • Extreme.Mathematics.LinearAlgebra.Complex Namespace
    • Extreme.Mathematics.LinearAlgebra.Complex.Decompositions Namespace
    • Extreme.Mathematics.LinearAlgebra.IO Namespace
    • Extreme.Mathematics.LinearAlgebra.IterativeSolvers Namespace
    • Extreme.Mathematics.LinearAlgebra.IterativeSolvers.Preconditioners Namespace
    • Extreme.Mathematics.LinearAlgebra.Providers Namespace
    • Extreme.Mathematics.LinearAlgebra.Sparse Namespace
    • Extreme.Mathematics.Optimization Namespace
    • Extreme.Mathematics.Optimization.LineSearches Namespace
    • Extreme.Mathematics.SignalProcessing Namespace
    • Extreme.Statistics Namespace
    • Extreme.Statistics.Distributions Namespace
    • Extreme.Statistics.IO Namespace
    • Extreme.Statistics.Multivariate Namespace
    • Extreme.Statistics.Random Namespace
    • Extreme.Statistics.Tests Namespace
    • Extreme.Statistics.TimeSeriesAnalysis Namespace
  • Extreme.Mathematics.LinearAlgebra.IterativeSolvers Namespace
    • BiConjugateGradientSolver Class
    • BiConjugateGradientStabilizedSolver Class
    • ConjugateGradientSolver Class
    • ConjugateGradientSquaredSolver Class
    • GaussSeidelSolver Class
    • GeneralizedMinimalResidualSolver Class
    • IterativeSparseSolver Class
    • JacobiSolver Class
    • QuasiMinimalResidualSolver Class
    • SuccessiveOverRelaxationSolver Class
Collapse image Expand Image Copy image CopyHover image
         




Extreme.Mathematics.LinearAlgebra.IterativeSolvers Namespace

The Extreme.LinearAlgebra.IterativeSolvers namespace contains classes that implement iterative solvers for large, sparse systems.

Classes

  Class Description
Public class BiConjugateGradientSolver
Represents a sparse linear solver that uses the bi-conjugate gradient algorithm.
Public class BiConjugateGradientStabilizedSolver
Constructs a new sparse linear solver that uses the bi-conjugate gradient algorithm.
Public class ConjugateGradientSolver
Represents a sparse linear solver that uses the standard conjugate gradient algorithm.
Public class ConjugateGradientSquaredSolver
Represents a sparse solver that uses the Conjugate Gradient Squared algorithm.
Public class GaussSeidelSolver
Represents a sparse linear solver that uses the Gauss-Seidel method.
Public class GeneralizedMinimalResidualSolver
Represents a sparse linear solver that uses the Gemeralized Minimal RESidual (GMRES) algorithm.
Public class IterativeSparseSolver
Represents an iterative algorithm for solving sparse linear systems.
Public class JacobiSolver
Represents a sparse linear solver that uses the Jacobi method.
Public class QuasiMinimalResidualSolver
Constructs a new sparse linear solver that uses the quasi-minimal residual algorithm.
Public class SuccessiveOverRelaxationSolver
Represents a sparse linear solver that uses the Successive Over-Relaxation (SOR) method.

Send comments on this topic to support@extremeoptimization.com

Copyright (c) 2004-2011 ExoAnalytics Inc.

Copyright © 2003-2013, Extreme Optimization. All rights reserved.
Extreme Optimization, Complexity made simple, M#, and M Sharp are trademarks of ExoAnalytics Inc.
Microsoft, Visual C#, Visual Basic, Visual Studio, Visual Studio.NET, and the Optimized for Visual Studio logo
are registered trademarks of Microsoft Corporation.