![JAR search and dependency download from the Maven repository](/logo.png)
org.ojalgo.function.polynomial.BigPolynomial Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of ojalgo Show documentation
Show all versions of ojalgo Show documentation
oj! Algorithms - ojAlgo - is Open Source Java code that has to do with mathematics, linear algebra and optimisation.
/*
* Copyright 1997-2021 Optimatika
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
package org.ojalgo.function.polynomial;
import java.math.BigDecimal;
import org.ojalgo.array.Array1D;
import org.ojalgo.function.constant.BigMath;
import org.ojalgo.matrix.decomposition.QR;
import org.ojalgo.matrix.store.GenericStore;
import org.ojalgo.matrix.store.PhysicalStore;
import org.ojalgo.scalar.RationalNumber;
import org.ojalgo.structure.Access1D;
import org.ojalgo.type.TypeUtils;
/**
* BigPolynomial
*
* @author apete
*/
public class BigPolynomial extends AbstractPolynomial {
public BigPolynomial(final int degree) {
super(Array1D.BIG.makeZero(degree + 1));
}
BigPolynomial(final Array1D coefficients) {
super(coefficients);
}
public void estimate(final Access1D> x, final Access1D> y) {
final int tmpRowDim = (int) Math.min(x.count(), y.count());
final int tmpColDim = this.size();
final PhysicalStore tmpBody = GenericStore.RATIONAL.makeZero(tmpRowDim, tmpColDim);
final PhysicalStore tmpRHS = GenericStore.RATIONAL.makeZero(tmpRowDim, 1);
for (int i = 0; i < tmpRowDim; i++) {
BigDecimal tmpX = BigMath.ONE;
final BigDecimal tmpXfactor = TypeUtils.toBigDecimal(x.get(i));
final BigDecimal tmpY = TypeUtils.toBigDecimal(y.get(i));
for (int j = 0; j < tmpColDim; j++) {
tmpBody.set(i, j, tmpX);
tmpX = tmpX.multiply(tmpXfactor);
}
tmpRHS.set(i, 0, tmpY);
}
final QR tmpQR = QR.RATIONAL.make();
tmpQR.decompose(tmpBody);
this.set(tmpQR.getSolution(tmpRHS));
}
public BigDecimal integrate(final BigDecimal fromPoint, final BigDecimal toPoint) {
final PolynomialFunction tmpPrim = this.buildPrimitive();
final BigDecimal tmpFromVal = tmpPrim.invoke(fromPoint);
final BigDecimal tmpToVal = tmpPrim.invoke(toPoint);
return tmpToVal.subtract(tmpFromVal);
}
public BigDecimal invoke(final BigDecimal arg) {
int tmpPower = this.degree();
BigDecimal retVal = this.get(tmpPower);
while (--tmpPower >= 0) {
retVal = this.get(tmpPower).add(arg.multiply(retVal));
}
return retVal;
}
public void set(final Access1D> coefficients) {
final int tmpLimit = (int) Math.min(this.count(), coefficients.count());
for (int p = 0; p < tmpLimit; p++) {
this.set(p, TypeUtils.toBigDecimal(coefficients.get(p)));
}
}
@Override
protected BigDecimal getDerivativeFactor(final int power) {
final int tmpNextIndex = power + 1;
return this.get(tmpNextIndex).multiply(new BigDecimal(tmpNextIndex));
}
@Override
protected BigDecimal getPrimitiveFactor(final int power) {
if (power <= 0) {
return BigMath.ZERO;
} else {
return this.get(power - 1).divide(new BigDecimal(power));
}
}
@Override
protected AbstractPolynomial makeInstance(final int size) {
return new BigPolynomial(Array1D.BIG.makeZero(size));
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy