Komputasi

Beberapa tulisan berikut adalah bahan kuliah pengenalan komputasi, simulasi dan komputasi matematika.




Halaman untuk belajar Python dan Data Sains untuk pemula : s.id/DS101





Comments

Post a Comment

Popular posts from this blog

Spiral Dynamics Optimization

Image
Spiral Dynamics Inspired Optimization ¶ Kenichi Tamura and Keiichiro Yasuda ¶ https://doi.org/10.20965/jaciii.2011.p1116 ¶ Ilustration ¶ In [1]: import math import numpy as np import copy import random import time import datetime import itertools import matplotlib.pyplot as plt from mpl_toolkits.mplot3d import Axes3D Rotation Model ¶ Rotation 2D ¶ In [2]: def x_rotate ( x , radius = 0.95 , theta = math . pi / 3 ): rotate_m = radius * np . array ([[ math . cos ( theta ), - math . sin ( theta )],[ math . sin ( theta ), math . cos ( theta )]]) return rotate_m @x def xvec_rotate ( xvec , center = [ 0 , 0 ], n = 10 , radius = 0.95 , theta =- math . pi / 3 ): rotate_m = radius * np . array ([[ math . co...
Read more

SD-Newton-Enhanced SD

Image
Enhanced_SD_web_rev1 Comparation Steepest Decent Method, Newton Method and Enhanced Steepest Decent Method ¶ Enhanced Steepest Decent By Mohamed Kamel Riahi on "A new approach to improve ill-conditioned parabolic optimal control problem via time domain decomposition" Numer Algor (2016) 72:635-666 DOI 10.1007/s11075-015-0060-0 https://www.researchgate.net/publication/278829050_A_new_approach_to_improve_ill-conditioned_parabolic_optimal_control_problem_via_time_domain_decomposition Example 1 ¶ Consider a problem minimize : $$f(\bar{x})=x_1^2+2x_2^2+3x_3^2+x_4^2+2x_5^2+4x_6^2-x_1-x_2-x_3-x_4-x_5-x_6$$ The problem will be solved using: Steepest Decent Method Newton Method Enhanced Steepest Decent: $\hat{n}=1$, equivalent to Steepest Decent Method $\hat{n}=2$ $\hat{n}=3$ $\hat{n}=6$, equivalent to Newton Method In [1]: import autograd.numpy as np from autograd impo...
Read more

Sudoku with IP

Table of Contents 1   Solving Sudoku with Integer Programming 2   Solve using MIP 3   Solve using Gurobi Solving Sudoku with Integer Programming ¶ Sudoku is played on a grid of 9 x 9 spaces. Within the rows and columns are 9 “squares” (made up of 3 x 3 spaces). Each row, column and square (9 spaces each) needs to be filled out with the numbers 1-9, without repeating any numbers within the row, column or square. https://sudoku.com/how-to-play/sudoku-rules-for-complete-beginners/ Basic sudoku has size 9 x 9 with number 1-9 as the filling. However, the size and the filling can be changed. Solve sudoku with Integer Programming Define : $N$ is a set of sudoku filling $N=[1,2,3,4,5,6,7,8,9]$ $N=[$a,b,c,d,e,f,g,h,i,j$]$ $N=[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16]$ etc $R$ is a set of sudoku row $R=[1,2,3,4,5,6,7,8,9]$ etc $C$ is a set of sudoku columns $C=[1,2,3,4,5,6,7,8,9]$ etc...
Read more

Aljabar Python

Python dapat mengoprasikan Aljabar dengan bantuan library numpy. Sedikit operasi vektor dan matriks yang penting diketahui In [1]: import numpy as np import math Vektor ¶ Penting : Bedakan ketika menulis u=[1,2,3] dan u=np.array([1,2,3]) yang pertama adalah list, yang kedua adalah vektor Tampilan vektor pada python selalu tertulis menyamping , walaupun kita tambahkan transpose, tampilan akan tetap menyamping. Hal ini sangat penting dan harus berhati-hati. u=np.array([1,2,3]) artinya $\mathbb{u}=\begin{bmatrix}1\\2\\3\end{bmatrix}$, tampilan pada python u= [1 2 3] np.transpose(u)=$\mathbb{u}^T=\begin{bmatrix}1&2&3\end{bmatrix}$, tampilan pada python u= [1 2 3] In [2]: u = [ 1 , 2 , 3 ] #ini adalah list, bukan vektor v = [ 4 , 5 , 6 ] #ini adalah list, bukan vektor print ( "List u=" , u ) print ( "List v=" , v ) print ( "Penjumlah...
Read more