Matlab exchange
From InterSciWiki
http://www.mathworks.com/matlabcentral/fileexchange/loadCategory.do
Contents |
[edit] Optimization
- All Pairs Shortest Path" Graph Solver 4-star
- Shortest Path with Obstacle Avoidance (ver 1.3) 4-star
- Hungarian Algorithm: An algorithm to find the minimum edge weight matching for an arbitrary bipartite graph 4-star
- tspsa - Simulated Annealing Optimization 3-star
- General simulated annealing algorithm 4-star
- Traveling Salesman Problem (TSP) using Simulated Annealing
- Optimization Tips and Tricks
- Particle Swarm Optimization Toolbox
- Particle Swarm Optimization Simulation
- Genetic Algorithm
- Optimization with MATLAB and the Genetic Algorithm and Direct Search Toolbox
- Solve a set of Nonlinear Equations
- LMFnlsq - Solution of nonlinear least squares
- LMFsolve.m: Levenberg-Marquardt-Fletcher algorithm for nonlinear least squares problems
- Minimize a Function of Several Variables
- bnb - BNB20 solves mixed integer nonlinear optimization problems
- Nonlinear Regression Shapes
- Minimum Volume Enclosing Ellipsoid
- Generalized Nonlinear Non-analytic Chi-Squared Fitting - Performs chi-square fit with uncertainty estimation when measurement errors are known.
- Bidirectional Branch and Bound Minimum Singular Value Solver (B3MSV)
- Graph Partitioning
- Using Statistics to Analyze Uncertainty in System Models
- QAP
- Hill climbing optimization
- [ ]
[edit] Physics and chemistry
- Navier stokes 5-star
- Dynamical systems
- Units conversion
- Lotka Volterra & Oregonator
- Numerical Inversion of Laplace Transforms
- Bifurcation Diagram for the cubic map and a realistic model for population dynamics
- Solution of a Maxwell Stefan Diffusion Problem
- Simple Units and Dimensions for Matlab
- the chemical reaction and phase equilibrium
[edit] General communications
- Dijkstra Shortest Path Routing
- Dijkstra's Greedy Routing Algorithm
- COMTRADE reader
- Extended Queueing Systems Simulation
- Gray coded matrix
[edit]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
- [ ]
