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.EquationSolvers Namespace
    • BisectionSolver Class
    • DekkerBrentSolver Class
    • DoglegSystemSolver Class
    • EquationSolver Class
    • EquationSystemSolver Class
    • NewtonRaphsonSolver Class
    • NewtonRaphsonSystemSolver Class
    • RegulaFalsiSolver Class
    • RootBracketingSolver Class
  • NewtonRaphsonSystemSolver Class
    • Members
    • Constructors
    • Methods
    • Properties
Collapse image Expand Image Copy image CopyHover image
         




NewtonRaphsonSystemSolver Class

Members See Also 
Represents a root finder based on the Newton-Raphson algorithm.

Namespace: Extreme.Mathematics.EquationSolvers
Assembly: Extreme.Numerics.Net40 (in Extreme.Numerics.Net40.dll) Version: 4.2.11333.0 (4.2.12253.0)

Syntax

C#
                      public sealed class NewtonRaphsonSystemSolver : EquationSystemSolver
Visual Basic (Declaration)
                      Public NotInheritable Class NewtonRaphsonSystemSolver _
	Inherits EquationSystemSolver
Visual C++
                      public ref class NewtonRaphsonSystemSolver sealed : public EquationSystemSolver
F#
[<SealedAttribute>]
type NewtonRaphsonSystemSolver =  
    class
        inherit EquationSystemSolver
    end

Remarks

Use the NewtonRaphsonSystemSolver class to solve a system of nonlinear equations using the Newton-Raphson method in multiple dimensions. This algorithm is suitable for 'easy' target functions. For most general applications, the DoglegSystemSolver class offers a more reliable solution.

The target functions are set in one of two ways. The TargetFunction property is a delegate that represents a multivariate function returning a vector in its second argument. This is a function that returns a vector containing the values each target function. Alternatively, the SetTargetFunctions(array<Func<(Of <<'(Vector, Double>)>>)>[]()[][]) method can be used to provide the target functions as an array of multivariate function delegates.

Similarly, the gradients of the target functions can be set in two ways. The JacobianFunction property is a delegate that represents a multivariate function returning a matrix in its second argument that calculates the Jacobian of the system of equations. The Jacobian is a matrix whose rows are the gradients of the target functions. Alternatively, the SetGradientFunctions(array<Func<(Of <<'(Vector, Vector>)>>)>[]()[][]) method lets you supply the gradients of individual target functions as an array of either multivariate function returning a vector or multivariate function returning a vector in its second argument delegates.

The starting point for the iteration is set through the InitialGuess property. This property must be set to a valid Vector before the algorithm is run. The AbsoluteTolerance and RelativeTolerance properties set the desired precision as specified by the ConvergenceCriterion property. The default value for both tolerances is SqrtEpsilon (roughly 10-8). MaxIterations sets the maximum number of iterations, while MaxEvaluations sets the maximum number of function evaluations.

The Solve(Vector) method performs the actual approximation of the solution. This method returns the best approximation that was found. The Status property indicates whether the algorithm was successful.

The algorithm has two convergence tests. By default, the algorithm terminates when either of these is satisfied. You can deactivate either test by setting its Active property to falseFalsefalsefalse (False in Visual Basic). If both tests are deactivated, then the algorithm always terminates when the maximum number of iterations or function evaluations is reached.

The first test is based on the uncertainty in the location of the approximate solution. The SolutionTest property returns a VectorConvergenceTest object that allows you to specify the desired Tolerance and specific ConvergenceCriterion. See the VectorConvergenceTest class for details on how to further customize this test.

The second test is based on the value of the target functions at the approximate solution. The ValueTest property returns a VectorConvergenceTest object that can be used to customize the test. By default, the error is set to the component with the largest absolute value.

Inheritance Hierarchy

System..::..Object
  Extreme.Mathematics.Algorithms..::..ManagedIterativeAlgorithm<(Of <(<'Object>)>)>
    Extreme.Mathematics.Algorithms..::..ManagedIterativeAlgorithm
      Extreme.Mathematics.EquationSolvers..::..EquationSystemSolver
        Extreme.Mathematics.EquationSolvers..::..NewtonRaphsonSystemSolver

See Also

NewtonRaphsonSystemSolver Members
Extreme.Mathematics.EquationSolvers Namespace
Extreme.Mathematics.EquationSolvers..::..DoglegSystemSolver

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.