add demos to README.md
This commit is contained in:
@@ -6,6 +6,7 @@ Mathematical utilities
|
||||
### linearrange/DemoLinearRange02
|
||||
|
||||
|
||||
|
||||

|
||||
|
||||
[source code](src/jvmDemo/kotlin/linearrange/DemoLinearRange02.kt)
|
||||
@@ -13,6 +14,7 @@ Mathematical utilities
|
||||
### linearrange/DemoLinearRange03
|
||||
|
||||
|
||||
|
||||

|
||||
|
||||
[source code](src/jvmDemo/kotlin/linearrange/DemoLinearRange03.kt)
|
||||
@@ -25,6 +27,7 @@ Line drawn in red is the estimated line, in green is the ground-truth line
|
||||
Ax = b => x = A⁻¹b
|
||||
because A is likely inconsistent, we look for an approximate x based on AᵀA, which is consistent.
|
||||
x̂ = (AᵀA)⁻¹ Aᵀb
|
||||
|
||||

|
||||
|
||||
[source code](src/jvmDemo/kotlin/matrix/DemoLeastSquares01.kt)
|
||||
@@ -32,6 +35,7 @@ x̂ = (AᵀA)⁻¹ Aᵀb
|
||||
### matrix/DemoLeastSquares02
|
||||
|
||||
Demonstrate least squares method to fit a cubic bezier to noisy points
|
||||
|
||||

|
||||
|
||||
[source code](src/jvmDemo/kotlin/matrix/DemoLeastSquares02.kt)
|
||||
@@ -39,6 +43,7 @@ Demonstrate least squares method to fit a cubic bezier to noisy points
|
||||
### rbf/RbfInterpolation01
|
||||
|
||||
|
||||
|
||||

|
||||
|
||||
[source code](src/jvmDemo/kotlin/rbf/RbfInterpolation01.kt)
|
||||
@@ -46,6 +51,7 @@ Demonstrate least squares method to fit a cubic bezier to noisy points
|
||||
### rbf/RbfInterpolation02
|
||||
|
||||
|
||||
|
||||

|
||||
|
||||
[source code](src/jvmDemo/kotlin/rbf/RbfInterpolation02.kt)
|
||||
@@ -53,6 +59,7 @@ Demonstrate least squares method to fit a cubic bezier to noisy points
|
||||
### simplexrange/DemoSimplexRange3D01
|
||||
|
||||
|
||||
|
||||

|
||||
|
||||
[source code](src/jvmDemo/kotlin/simplexrange/DemoSimplexRange3D01.kt)
|
||||
|
||||
Reference in New Issue
Block a user