Suche senden
Hochladen
Maple Code for Steepest Descent
•
Als DOCX, PDF herunterladen
•
0 gefällt mir
•
748 views
J
Jeremy Lane
Folgen
Melden
Teilen
Melden
Teilen
1 von 1
Jetzt herunterladen
Empfohlen
week-18x
week-18x
KITE www.kitecolleges.com
week-10x
week-10x
KITE www.kitecolleges.com
Euler method in c
Euler method in c
Subir Halder
week-23x
week-23x
KITE www.kitecolleges.com
week-17x
week-17x
KITE www.kitecolleges.com
week-1x
week-1x
KITE www.kitecolleges.com
week-11x
week-11x
KITE www.kitecolleges.com
Runge kutta C programme
Runge kutta C programme
Shah Keval
Empfohlen
week-18x
week-18x
KITE www.kitecolleges.com
week-10x
week-10x
KITE www.kitecolleges.com
Euler method in c
Euler method in c
Subir Halder
week-23x
week-23x
KITE www.kitecolleges.com
week-17x
week-17x
KITE www.kitecolleges.com
week-1x
week-1x
KITE www.kitecolleges.com
week-11x
week-11x
KITE www.kitecolleges.com
Runge kutta C programme
Runge kutta C programme
Shah Keval
week-8x
week-8x
KITE www.kitecolleges.com
programa suma y multiplica
programa suma y multiplica
Maria Amaro
Creative Coding 1 - 2 Variables
Creative Coding 1 - 2 Variables
Till Nagel
Bcsl 033 data and file structures lab s2-1
Bcsl 033 data and file structures lab s2-1
Dr. Loganathan R
2 d rotation
2 d rotation
Chandu Kumare
Bcsl 033 data and file structures lab s2-2
Bcsl 033 data and file structures lab s2-2
Dr. Loganathan R
Assignmnt 4
Assignmnt 4
Sajid Khokhar
Bcsl 033 data and file structures lab s1-1
Bcsl 033 data and file structures lab s1-1
Dr. Loganathan R
Add digits of number in c
Add digits of number in c
mohdshanu
Bcsl 033 data and file structures lab s1-3
Bcsl 033 data and file structures lab s1-3
Dr. Loganathan R
C programs pbq final
C programs pbq final
Azad public school
week-4x
week-4x
KITE www.kitecolleges.com
Tipos de funciones
Tipos de funciones
JanethCacuango1
PROYECTO PEDRO
PROYECTO PEDRO
PedroToapanta
Bcsl 033 data and file structures lab s2-3
Bcsl 033 data and file structures lab s2-3
Dr. Loganathan R
LAB PROGRAMS SARASWATHI RAMALINGAM
LAB PROGRAMS SARASWATHI RAMALINGAM
SaraswathiRamalingam
Faisal
Faisal
Faisal Saeed
Metnum
Metnum
ratnaaning
Bcsl 033 data and file structures lab s3-1
Bcsl 033 data and file structures lab s3-1
Dr. Loganathan R
Program in ‘C’ language to implement linear search using pointers
Program in ‘C’ language to implement linear search using pointers
Dr. Loganathan R
DurbinWatsonVBA
DurbinWatsonVBA
Jeremy Lane
SAS example
SAS example
Jeremy Lane
Weitere ähnliche Inhalte
Was ist angesagt?
week-8x
week-8x
KITE www.kitecolleges.com
programa suma y multiplica
programa suma y multiplica
Maria Amaro
Creative Coding 1 - 2 Variables
Creative Coding 1 - 2 Variables
Till Nagel
Bcsl 033 data and file structures lab s2-1
Bcsl 033 data and file structures lab s2-1
Dr. Loganathan R
2 d rotation
2 d rotation
Chandu Kumare
Bcsl 033 data and file structures lab s2-2
Bcsl 033 data and file structures lab s2-2
Dr. Loganathan R
Assignmnt 4
Assignmnt 4
Sajid Khokhar
Bcsl 033 data and file structures lab s1-1
Bcsl 033 data and file structures lab s1-1
Dr. Loganathan R
Add digits of number in c
Add digits of number in c
mohdshanu
Bcsl 033 data and file structures lab s1-3
Bcsl 033 data and file structures lab s1-3
Dr. Loganathan R
C programs pbq final
C programs pbq final
Azad public school
week-4x
week-4x
KITE www.kitecolleges.com
Tipos de funciones
Tipos de funciones
JanethCacuango1
PROYECTO PEDRO
PROYECTO PEDRO
PedroToapanta
Bcsl 033 data and file structures lab s2-3
Bcsl 033 data and file structures lab s2-3
Dr. Loganathan R
LAB PROGRAMS SARASWATHI RAMALINGAM
LAB PROGRAMS SARASWATHI RAMALINGAM
SaraswathiRamalingam
Faisal
Faisal
Faisal Saeed
Metnum
Metnum
ratnaaning
Bcsl 033 data and file structures lab s3-1
Bcsl 033 data and file structures lab s3-1
Dr. Loganathan R
Program in ‘C’ language to implement linear search using pointers
Program in ‘C’ language to implement linear search using pointers
Dr. Loganathan R
Was ist angesagt?
(20)
week-8x
week-8x
programa suma y multiplica
programa suma y multiplica
Creative Coding 1 - 2 Variables
Creative Coding 1 - 2 Variables
Bcsl 033 data and file structures lab s2-1
Bcsl 033 data and file structures lab s2-1
2 d rotation
2 d rotation
Bcsl 033 data and file structures lab s2-2
Bcsl 033 data and file structures lab s2-2
Assignmnt 4
Assignmnt 4
Bcsl 033 data and file structures lab s1-1
Bcsl 033 data and file structures lab s1-1
Add digits of number in c
Add digits of number in c
Bcsl 033 data and file structures lab s1-3
Bcsl 033 data and file structures lab s1-3
C programs pbq final
C programs pbq final
week-4x
week-4x
Tipos de funciones
Tipos de funciones
PROYECTO PEDRO
PROYECTO PEDRO
Bcsl 033 data and file structures lab s2-3
Bcsl 033 data and file structures lab s2-3
LAB PROGRAMS SARASWATHI RAMALINGAM
LAB PROGRAMS SARASWATHI RAMALINGAM
Faisal
Faisal
Metnum
Metnum
Bcsl 033 data and file structures lab s3-1
Bcsl 033 data and file structures lab s3-1
Program in ‘C’ language to implement linear search using pointers
Program in ‘C’ language to implement linear search using pointers
Mehr von Jeremy Lane
DurbinWatsonVBA
DurbinWatsonVBA
Jeremy Lane
SAS example
SAS example
Jeremy Lane
Mahalanobis Distance R
Mahalanobis Distance R
Jeremy Lane
Hypothesis Testing
Hypothesis Testing
Jeremy Lane
torsionbinormalnotes
torsionbinormalnotes
Jeremy Lane
shrinkingcircle
shrinkingcircle
Jeremy Lane
Mehr von Jeremy Lane
(6)
DurbinWatsonVBA
DurbinWatsonVBA
SAS example
SAS example
Mahalanobis Distance R
Mahalanobis Distance R
Hypothesis Testing
Hypothesis Testing
torsionbinormalnotes
torsionbinormalnotes
shrinkingcircle
shrinkingcircle
Maple Code for Steepest Descent
1.
Maple Code for
Steepest Descent func:= (x,y) -> x^2 – y; initx := 1; inity := 1; funcx := diff(func(x,y),x); funcy := diff(func(x,y),y); a1 := initx; b1 := inity; for I from 1 to 20 do a := a1; b:= b1; currentval := evalf(func(a,b)); print(`current a ` = a, `current b` = b, `current val` = currentval); fxpoint := evalf(subs({x = a, y = b}, funcx); fypoint := evalf(subs({x = a, y = b},funcy); print(`current gradient` = [fxpoint,fypoint]); pathdiff := diff(func(a+fxpoint*t, b+ fypoint*t),t); tmin := fsolve(pathdiff, t=0); a1 := a + tmin*fxpoint; b1 := b + tmin* fypoint; func(a1,b1); od:
Jetzt herunterladen