NMExactCalciumField¶
jnemo.spad line 1172 [edit on github]
NMExactCalciumField implements exact complex field arithmetic using the NM
package. Reference: https://nemocas.github.io/NM.jl
See https://flintlib.org/doc/introduction_calcium.html for the C
library.
- 0: %
from AbelianMonoid
- 1: %
from MagmaWithUnit
- *: (%, Integer) -> %
x*n
is the product ofx
by the integern
.- *: (Fraction Integer, %) -> %
from LeftModule Fraction Integer
- *: (Integer, %) -> %
from AbelianGroup
- *: (NMInteger, %) -> %
from JLObjectRing
- *: (NonNegativeInteger, %) -> %
from AbelianMonoid
- *: (PositiveInteger, %) -> %
from AbelianSemiGroup
- +: (%, %) -> %
from AbelianSemiGroup
- -: % -> %
from AbelianGroup
- -: (%, %) -> %
from AbelianGroup
- /: (%, Integer) -> %
/ undocumented
- /: (Integer, %) -> %
/ undocumented
- <=: (%, %) -> Boolean
from PartialOrder
- <: (%, %) -> Boolean
from PartialOrder
- >=: (%, %) -> Boolean
from PartialOrder
- >: (%, %) -> Boolean
from PartialOrder
- ^: (%, %) -> %
- ^: (%, Fraction Integer) -> %
from RadicalCategory
- ^: (%, Integer) -> %
from DivisionRing
- ^: (%, NonNegativeInteger) -> %
from MagmaWithUnit
- ^: (%, PositiveInteger) -> %
from Magma
- acos: % -> %
- acos: (%, JLSymbol) -> %
acos(x,repr)
returns acos(x
) using one of therepr
representations: :default (since ‘default’ is a FriCAS keyword use jsym(String) to coerce it) :logarithm :direct
- acosh: % -> %
- acot: % -> %
- acoth: % -> %
- acsc: % -> %
- acsch: % -> %
- algebraic?: % -> Boolean
algebraic?(x)
checks whether or notx
is algebraic.
- annihilate?: (%, %) -> Boolean
from Rng
- antiCommutator: (%, %) -> %
- argument: % -> %
from ComplexCategory %
- asec: % -> %
- asech: % -> %
- asin: % -> %
- asin: (%, JLSymbol) -> %
asin(x, repr)
returns asin(x
) using one of the repr representations: :default (since ‘default’ is a FriCAS keyword use jsym(String) to coerce it) :logarithm :direct
- asinh: % -> %
- associates?: (%, %) -> Boolean
from EntireRing
- associator: (%, %, %) -> %
from NonAssociativeRng
- atan: % -> %
- atan: (%, JLSymbol) -> %
atan(x, repr)
returns atan(x
) using one of the repr representations: :default (since ‘default’ is a FriCAS keyword use jsym(String) to coerce it) :logarithm :direct or :arctangent
- atanh: % -> %
- basis: () -> Vector %
from FramedModule %
- ceiling: % -> %
ceiling(z)
returns the smallest integer above or equal toz
.
- characteristic: () -> NonNegativeInteger
from NonAssociativeRing
- characteristicPolynomial: % -> SparseUnivariatePolynomial %
from FiniteRankAlgebra(%, SparseUnivariatePolynomial %)
- coerce: % -> %
from Algebra %
- coerce: % -> JLObject
from JLObjectType
- coerce: % -> OutputForm
from CoercibleTo OutputForm
- coerce: Fraction Integer -> %
coerce(q)
coercesq
. Convenience function.- coerce: Integer -> %
from NonAssociativeRing
- coerce: NMAlgebraicNumber -> %
coerce(qbar)
coercesqbar
. Convenience function.
- coerce: NMFraction NMInteger -> %
coerce(q)
coercesq
. Convenience function.
- coerce: PositiveInteger -> %
coerce(pi)
coercespi
. Convenience function.
- commutator: (%, %) -> %
from NonAssociativeRng
- complex: (%, %) -> %
from ComplexCategory %
- complexNormalForm: % -> %
complexNormalForm(x)
returnsx
rewritten using standard transformations. See theNM
.jl
documentation fo more informations.
- conditionP: Matrix % -> Union(Vector %, failed) if % has CharacteristicNonZero and % has PolynomialFactorizationExplicit or % has FiniteFieldCategory
- conjugate: % -> %
from ComplexCategory %
- conjugate: (%, JLSymbol) -> %
conjugate(x, repr)
returns conjugate(x
) using one of the repr representations: :default (since ‘default’ is a FriCAS keyword use jsym(String) to coerce it) :deep (recursively) :shallow (a new extension,ā
, is used if there is no express simplification)
- convert: % -> SparseUnivariatePolynomial %
- convert: % -> String
from ConvertibleTo String
- convert: % -> Vector %
from FramedModule %
- convert: SparseUnivariatePolynomial % -> %
from MonogenicAlgebra(%, SparseUnivariatePolynomial %)
- convert: Vector % -> %
from FramedModule %
- coordinates: % -> Vector %
from FramedModule %
- coordinates: (%, Vector %) -> Vector %
from FiniteRankAlgebra(%, SparseUnivariatePolynomial %)
- coordinates: (Vector %, Vector %) -> Matrix %
from FiniteRankAlgebra(%, SparseUnivariatePolynomial %)
- coordinates: Vector % -> Matrix %
from FramedModule %
- cos: % -> %
- cos: (%, JLSymbol) -> %
cos(x, repr)
returns cos(x
) using one of the repr representations: :default (since ‘default’ is a FriCAS keyword use jsym(String) to coerce it) :exponential :tangent :direct or :sine_cosine
- cosh: % -> %
- cot: % -> %
- coth: % -> %
- csc: % -> %
- csch: % -> %
- csign: % -> %
csign(x)
is an extension of the real sign function, x/sqrt(x^2
) unlessx
is 0 (0 in this case).
- D: (%, % -> %) -> %
from DifferentialExtension %
- D: (%, % -> %, NonNegativeInteger) -> %
from DifferentialExtension %
- definingPolynomial: () -> SparseUnivariatePolynomial %
from MonogenicAlgebra(%, SparseUnivariatePolynomial %)
- derivationCoordinates: (Vector %, % -> %) -> Matrix %
from MonogenicAlgebra(%, SparseUnivariatePolynomial %)
- differentiate: % -> % if % has DifferentialRing
from DifferentialRing
- differentiate: (%, % -> %) -> %
from DifferentialExtension %
- differentiate: (%, % -> %, NonNegativeInteger) -> %
from DifferentialExtension %
- differentiate: (%, NonNegativeInteger) -> % if % has DifferentialRing
from DifferentialRing
- discriminant: () -> %
from FramedAlgebra(%, SparseUnivariatePolynomial %)
- discriminant: Vector % -> %
from FiniteRankAlgebra(%, SparseUnivariatePolynomial %)
- divide: (%, %) -> Record(quotient: %, remainder: %)
from EuclideanDomain
- erf: % -> %
erf(x)
is the error function evaluated atx
.
- erfc: % -> %
erfc(x)
is the complementary error function evaluated atx
.
- erfi: % -> %
erfi(x)
is the imaginary error function evaluated atx
.
- euclideanSize: % -> NonNegativeInteger
from EuclideanDomain
- eulerGamma: () -> %
eulerGamma()
returns the Euler's
constant gamma (γ
).
- exp1: () -> %
exp() returns
ℯ
(exp(1)).
- exp: % -> %
- exp: () -> %
exp()
returnsℯ
(exp(1)).
- expressIdealMember: (List %, %) -> Union(List %, failed)
from PrincipalIdealDomain
- exquo: (%, %) -> Union(%, failed)
from ComplexCategory %
- extendedEuclidean: (%, %) -> Record(coef1: %, coef2: %, generator: %)
from EuclideanDomain
- extendedEuclidean: (%, %, %) -> Union(Record(coef1: %, coef2: %), failed)
from EuclideanDomain
- factorPolynomial: SparseUnivariatePolynomial % -> Factored SparseUnivariatePolynomial % if % has PolynomialFactorizationExplicit
- factorSquareFreePolynomial: SparseUnivariatePolynomial % -> Factored SparseUnivariatePolynomial % if % has PolynomialFactorizationExplicit
- floor: % -> %
floor(z)
returns the largest integer below or equal otz
.
- Gamma: % -> %
Gamma(x)
is the Euler Gamma function evaluated atx
.
- gcdPolynomial: (SparseUnivariatePolynomial %, SparseUnivariatePolynomial %) -> SparseUnivariatePolynomial %
from GcdDomain
- generator: () -> %
from MonogenicAlgebra(%, SparseUnivariatePolynomial %)
- hashUpdate!: (HashState, %) -> HashState if % has Hashable
from Hashable
- imag: % -> %
from ComplexCategory %
- imaginary?: % -> Boolean
imaginary?(x)
checks whether or notx
is imaginary.
- imaginary: () -> %
from ComplexCategory %
- index: PositiveInteger -> % if % has Finite
from Finite
- infinity?: % -> Boolean
infinity?(x)
checks whether or notx
is an infinity.
- infinity: % -> %
infinity(x)
returns signed infinity depending onx
sign.
- infinity: () -> %
infinity()
returns unsigned infinity.
- integer?: % -> Boolean
integer?(z)
checks whether or notz
is an integer.
- inv: % -> %
from DivisionRing
- jlAbout: % -> Void
from JLObjectType
- jlApply: (String, %) -> %
from JLObjectType
- jlApply: (String, %, %) -> %
from JLObjectType
- jlApply: (String, %, %, %) -> %
from JLObjectType
- jlApply: (String, %, %, %, %) -> %
from JLObjectType
- jlApply: (String, %, %, %, %, %) -> %
from JLObjectType
- jlDisplay: % -> Void
from JLObjectType
- jlId: % -> JLInt64
from JLObjectType
- jlOptions: % -> JLObjDict
jlOptions(x)
returns the options used during compoutations.
- jlRef: % -> SExpression
from JLObjectType
- jlref: String -> %
from JLObjectType
- jlType: % -> String
from JLObjectType
- jnecf: (Fraction Integer, Fraction Integer) -> %
jnecf(real,cplx)
coercesreal
andcplx
to aNM
exact complex number wherereal
is thereal
part andcplx
the complex part.
- jnecf: (NMFraction NMInteger, NMFraction NMInteger) -> %
jnecf(real,cplx)
coercesreal
andcplx
to aNM
exact wherereal
is thereal
part andcplx
the complex part.
- jnecf: NMAlgebraicNumber -> %
jnecf(qbar)
coercesqbar
to aNM
exact real or complex number.
- jnecf: NMFraction NMInteger -> %
jnecf(nr)
coercesnr
to aNM
exact real number.
- latex: % -> String
from SetCategory
- lcmCoef: (%, %) -> Record(llcm_res: %, coeff1: %, coeff2: %)
from LeftOreRing
- leftPower: (%, NonNegativeInteger) -> %
from MagmaWithUnit
- leftPower: (%, PositiveInteger) -> %
from Magma
- leftRecip: % -> Union(%, failed)
from MagmaWithUnit
- lift: % -> SparseUnivariatePolynomial %
from MonogenicAlgebra(%, SparseUnivariatePolynomial %)
- log: % -> %
- lookup: % -> PositiveInteger if % has Finite
from Finite
- map: (% -> %, %) -> %
from FullyEvalableOver %
- max: (%, %) -> %
from OrderedSet
- min: (%, %) -> %
from OrderedSet
- minimalPolynomial: % -> SparseUnivariatePolynomial %
from FiniteRankAlgebra(%, SparseUnivariatePolynomial %)
- multiEuclidean: (List %, %) -> Union(List %, failed)
from EuclideanDomain
- mutable?: % -> Boolean
from JLObjectType
- negativeInfinity: () -> %
negativeInfinity()
returns negtive infinity.
- norm: % -> %
from ComplexCategory %
- nothing?: % -> Boolean
from JLObjectType
- nthRoot: (%, Integer) -> %
from RadicalCategory
- number?: % -> Boolean
number?(x)
checks whether or notx
is a number, i.e. not an infinity or an undefined value.
- one?: % -> Boolean
from MagmaWithUnit
- opposite?: (%, %) -> Boolean
from AbelianMonoid
- pi: () -> %
pi()
returnsπ
.
- plenaryPower: (%, PositiveInteger) -> %
- positiveInfinity: () -> %
positiveInfinity()
returns positive infinity.
- pow: (%, Integer, JLSymbol) -> %
pow(x, i, repr)
x
raised to poweri
using one of the repr representations: :default (since ‘default’ is a FriCAS keyword use jsym(String) to coerce it) :arithmetic See theNM
documentation for more information.
- principalIdeal: List % -> Record(coef: List %, generator: %)
from PrincipalIdealDomain
- quo: (%, %) -> %
from EuclideanDomain
- random: (Integer, Integer) -> %
random(depth, bits)
returns a random number with size of coefficients up to bits. ifdepth
is nonzero, apply a random arithmetic operation/function to operands produced using recursive calls withdepth
- 1.
- random: (Integer, Integer, JLSymbol) -> %
random(depth, bits, type)
returns a random number with size of coefficients up tobits
. ifdepth
is nonzero, apply a random arithmetic operation/function to operands produced using recursive calls withdepth
- 1.depth
is not used for rationals. type can be one of: :rational (returns a rational) :null (returns value with default settings) :special (returns a special value of a number - can throw an error if it isn't
a number).
- rank: () -> PositiveInteger
from FramedModule %
- rational?: % -> Boolean
rational?(x)
checks whether or notx
is a rational number.
- real?: % -> Boolean
real?(z)
checks whether or notz
is a real number.
- real: % -> %
from ComplexCategory %
- recip: % -> Union(%, failed)
from MagmaWithUnit
- reduce: Fraction SparseUnivariatePolynomial % -> Union(%, failed)
from MonogenicAlgebra(%, SparseUnivariatePolynomial %)
- reduce: SparseUnivariatePolynomial % -> %
from MonogenicAlgebra(%, SparseUnivariatePolynomial %)
- reducedSystem: (Matrix %, Vector %) -> Record(mat: Matrix %, vec: Vector %)
from LinearlyExplicitOver %
- reducedSystem: Matrix % -> Matrix %
from LinearlyExplicitOver %
- regularRepresentation: % -> Matrix %
from FramedAlgebra(%, SparseUnivariatePolynomial %)
- regularRepresentation: (%, Vector %) -> Matrix %
from FiniteRankAlgebra(%, SparseUnivariatePolynomial %)
- rem: (%, %) -> %
from EuclideanDomain
- represents: (Vector %, Vector %) -> %
from FiniteRankAlgebra(%, SparseUnivariatePolynomial %)
- represents: Vector % -> %
from FramedModule %
- retract: % -> %
from RetractableTo %
- retract: % -> NMComplexBall
convert(
x
) convertsx
.
- retractIfCan: % -> Union(%, failed)
from RetractableTo %
- retractIfCan: % -> Union(NMAlgebraicNumber, failed)
retractIfCan(z)
retracts if possiblez
to a NMAlgebraicNumber.
- retractIfCan: % -> Union(NMFraction NMInteger, failed)
retractIfCan(z)
retracts if possiblez
to a NMFraction(NMInteger).
- retractIfCan: % -> Union(NMInteger, failed)
retractIfCan(z)
retracts if possiblez
to a Integer.
- retractIfCan: % -> Union(NMRealBall, failed)
convert(
x
) convertsx
.
- rightPower: (%, NonNegativeInteger) -> %
from MagmaWithUnit
- rightPower: (%, PositiveInteger) -> %
from Magma
- rightRecip: % -> Union(%, failed)
from MagmaWithUnit
- sample: %
from AbelianMonoid
- sec: % -> %
- sech: % -> %
- sign: % -> %
sign(x)
returns sign ofx
.
- signedInfinity?: % -> Boolean
signedInfinity?(x)
checks whether or notx
is a signed infinity.
- sin: % -> %
- sin: (%, JLSymbol) -> %
sin(x, repr)
return sin(x
) using one of the repr representations: :default (since ‘default’ is a FriCAS keyword use jsym(String) to coerce it) :exponential :tangent :direct
- sinh: % -> %
- size: () -> NonNegativeInteger if % has Finite
from Finite
- sizeLess?: (%, %) -> Boolean
from EuclideanDomain
- smaller?: (%, %) -> Boolean
from Comparable
- solveLinearPolynomialEquation: (List SparseUnivariatePolynomial %, SparseUnivariatePolynomial %) -> Union(List SparseUnivariatePolynomial %, failed) if % has PolynomialFactorizationExplicit
- sqrt: % -> %
from RadicalCategory
- squareFree: % -> Factored %
- squareFreePart: % -> %
- subtractIfCan: (%, %) -> Union(%, failed)
- tan: % -> %
- tan: (%, JLSymbol) -> %
tan(x, repr)
returns tan(x
) using one of the repr representations: :default (since ‘default’ is a FriCAS keyword use jsym(String) to coerce it) :exponential :direct or :tangent :sine_cosine
- tanh: % -> %
- trace: % -> %
from FiniteRankAlgebra(%, SparseUnivariatePolynomial %)
- traceMatrix: () -> Matrix %
from FramedAlgebra(%, SparseUnivariatePolynomial %)
- traceMatrix: Vector % -> Matrix %
from FiniteRankAlgebra(%, SparseUnivariatePolynomial %)
- undefined?: % -> Boolean
undefined?(x)
checks whether or notx
is undefined.
- undefined: () -> %
undefined()
returns the undefined special value.
- unit?: % -> Boolean
from EntireRing
- unitCanonical: % -> %
from EntireRing
- unitNormal: % -> Record(unit: %, canonical: %, associate: %)
from EntireRing
- unknown?: % -> Boolean
unknown?(x)
checks whether or notx
is unknown.
- unknown: () -> %
unknown()
returns the unknown special value.
- unsignedInfinity?: % -> Boolean
unsignedInfinity?(x)
checks whether or notx
is an unsigned infinity.
- zero?: % -> Boolean
from AbelianMonoid
Algebra %
ArcTrigonometricFunctionCategory
BiModule(%, %)
BiModule(Fraction Integer, Fraction Integer)
ConvertibleTo SparseUnivariatePolynomial %
FiniteRankAlgebra(%, SparseUnivariatePolynomial %)
FramedAlgebra(%, SparseUnivariatePolynomial %)
Module %
MonogenicAlgebra(%, SparseUnivariatePolynomial %)
NonAssociativeAlgebra Fraction Integer
PolynomialFactorizationExplicit