Searching for linear : 989 results found | RSS Feed for this search

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40

2.034J Nonlinear Dynamics and Waves (MIT) 2.034J Nonlinear Dynamics and Waves (MIT)

Description

This graduate-level course provides a unified treatment of nonlinear oscillations and wave phenomena with applications to mechanical, optical, geophysical, fluid, electrical and flow-structure interaction problems. This graduate-level course provides a unified treatment of nonlinear oscillations and wave phenomena with applications to mechanical, optical, geophysical, fluid, electrical and flow-structure interaction problems.Subjects

nonlinear oscillations | nonlinear oscillations | wave phenomena | wave phenomena | flow-structure interaction problems | flow-structure interaction problems | nonlinear free and forced vibrations | nonlinear free and forced vibrations | nonlinear resonances | nonlinear resonances | self-excited oscillations | self-excited oscillations | lock-in phenomena | lock-in phenomena | nonlinear dispersive and nondispersive waves | nonlinear dispersive and nondispersive waves | resonant wave interactions | resonant wave interactions | propagation of wave pulses | propagation of wave pulses | nonlinear Schrodinger equation | nonlinear Schrodinger equation | nonlinear long waves and breaking | nonlinear long waves and breaking | theory of characteristics | theory of characteristics | the Korteweg-de Vries equation | the Korteweg-de Vries equation | solitons and solitary wave interactions | solitons and solitary wave interactions | stability of shear flows | stability of shear flowsLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata18.156 Differential Analysis (MIT) 18.156 Differential Analysis (MIT)

Description

The main goal of this course is to give the students a solid foundation in the theory of elliptic and parabolic linear partial differential equations. It is the second semester of a two-semester, graduate-level sequence on Differential Analysis. The main goal of this course is to give the students a solid foundation in the theory of elliptic and parabolic linear partial differential equations. It is the second semester of a two-semester, graduate-level sequence on Differential Analysis.Subjects

Sobolev spaces | Sobolev spaces | Fredholm alternative | Fredholm alternative | Variable coefficient elliptic | parabolic and hyperbolic linear partial differential equations | Variable coefficient elliptic | parabolic and hyperbolic linear partial differential equations | Variational methods | Variational methods | Viscosity solutions of fully nonlinear partial differential equations | Viscosity solutions of fully nonlinear partial differential equations | Schauder theory | Schauder theory | Holder estimates | Holder estimates | linear equations | linear equations | second derivatives | second derivatives | elliptic | elliptic | parabolic | parabolic | nonlinear partial differential equations | nonlinear partial differential equations | linear partial differential equations | linear partial differential equations | harmonic functions | harmonic functions | elliptic equations | elliptic equations | parabolic equations | parabolic equationsLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata18.701 Algebra I (MIT) 18.701 Algebra I (MIT)

Description

This undergraduate level Algebra I course covers groups, vector spaces, linear transformations, symmetry groups, bilinear forms, and linear groups. This undergraduate level Algebra I course covers groups, vector spaces, linear transformations, symmetry groups, bilinear forms, and linear groups.Subjects

Group Theory | Group Theory | Linear Algebra | and Geometry | Linear Algebra | and Geometry | groups | groups | vector spaces | vector spaces | linear transformations | linear transformations | symmetry groups | symmetry groups | bilinear | bilinear | bilinear forms | and linear groups | bilinear forms | and linear groupsLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata18.701 Algebra I (MIT) 18.701 Algebra I (MIT)

Description

The subjects to be covered include groups, vector spaces, linear transformations, symmetry groups, bilinear forms, and linear groups. The subjects to be covered include groups, vector spaces, linear transformations, symmetry groups, bilinear forms, and linear groups.Subjects

Group Theory | Group Theory | Linear Algebra | and Geometry | Linear Algebra | and Geometry | groups | groups | vector spaces | vector spaces | linear transformations | linear transformations | symmetry groups | symmetry groups | bilinear | bilinear | bilinear forms | and linear groups | bilinear forms | and linear groupsLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata16.323 Principles of Optimal Control (MIT) 16.323 Principles of Optimal Control (MIT)

Description

This course studies the principles of deterministic optimal control. It uses variational calculus and Pontryagin's maximum principle. It focuses on applications of the theory, including optimal feedback control, time-optimal control, and others. Dynamic programming and numerical search algorithms are introduced briefly. This course studies the principles of deterministic optimal control. It uses variational calculus and Pontryagin's maximum principle. It focuses on applications of the theory, including optimal feedback control, time-optimal control, and others. Dynamic programming and numerical search algorithms are introduced briefly.Subjects

nonlinear optimization | nonlinear optimization | linear quadratic regulators | linear quadratic regulators | MATLAB implementation | MATLAB implementation | dynamic programming | dynamic programming | calculus of variations | calculus of variations | LQR | LQR | LQG | LQG | stochastic optimization | stochastic optimization | on-line optimization and control | on-line optimization and control | constrained optimization | constrained optimization | signals | signals | system norms | system norms | Model Predictive Behavior | Model Predictive Behavior | quadratic programming | quadratic programming | mixed-integer linear programming | mixed-integer linear programming | linear programming | linear programmingLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata6.832 Underactuated Robotics (MIT) 6.832 Underactuated Robotics (MIT)

Description

Includes audio/video content: AV lectures. Robots today move far too conservatively, using control systems that attempt to maintain full control authority at all times. Humans and animals move much more aggressively by routinely executing motions which involve a loss of instantaneous control authority. Controlling nonlinear systems without complete control authority requires methods that can reason about and exploit the natural dynamics of our machines. This course discusses nonlinear dynamics and control of underactuated mechanical systems, with an emphasis on machine learning methods. Topics include nonlinear dynamics of passive robots (walkers, swimmers, flyers), motion planning, partial feedback linearization, energy-shaping control, analytical optimal control, reinforcement learning/a Includes audio/video content: AV lectures. Robots today move far too conservatively, using control systems that attempt to maintain full control authority at all times. Humans and animals move much more aggressively by routinely executing motions which involve a loss of instantaneous control authority. Controlling nonlinear systems without complete control authority requires methods that can reason about and exploit the natural dynamics of our machines. This course discusses nonlinear dynamics and control of underactuated mechanical systems, with an emphasis on machine learning methods. Topics include nonlinear dynamics of passive robots (walkers, swimmers, flyers), motion planning, partial feedback linearization, energy-shaping control, analytical optimal control, reinforcement learning/aSubjects

underactuated robotics | underactuated robotics | actuated systems | actuated systems | nonlinear dynamics | nonlinear dynamics | simple pendulum | simple pendulum | optimal control | optimal control | double integrator | double integrator | quadratic regulator | quadratic regulator | Hamilton-Jacobi-Bellman sufficiency | Hamilton-Jacobi-Bellman sufficiency | minimum time control | minimum time control | acrobot | acrobot | cart-pole | cart-pole | partial feedback linearization | partial feedback linearization | energy shaping | energy shaping | policy search | policy search | open-loop optimal control | open-loop optimal control | trajectory stabilization | trajectory stabilization | iterative linear quadratic regulator | iterative linear quadratic regulator | differential dynamic programming | differential dynamic programming | walking models | walking models | rimless wheel | rimless wheel | compass gait | compass gait | kneed compass gait | kneed compass gait | feedback control | feedback control | running models | running models | spring-loaded inverted pendulum | spring-loaded inverted pendulum | Raibert hoppers | Raibert hoppers | motion planning | motion planning | randomized motion planning | randomized motion planning | rapidly-exploring randomized trees | rapidly-exploring randomized trees | probabilistic road maps | probabilistic road maps | feedback motion planning | feedback motion planning | planning with funnels | planning with funnels | linear quadratic regulator | linear quadratic regulator | function approximation | function approximation | state distribution dynamics | state distribution dynamics | state estimation | state estimation | stochastic optimal control | stochastic optimal control | aircraft | aircraft | swimming | swimming | flapping flight | flapping flight | randomized policy gradient | randomized policy gradient | model-free value methods | model-free value methods | temporarl difference learning | temporarl difference learning | Q-learning | Q-learning | actor-critic methods | actor-critic methodsLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allavcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadataDescription

Includes audio/video content: AV lectures. This graduate-level course is a continuation of Mathematical Methods for Engineers I (18.085). Topics include numerical methods; initial-value problems; network flows; and optimization. Includes audio/video content: AV lectures. This graduate-level course is a continuation of Mathematical Methods for Engineers I (18.085). Topics include numerical methods; initial-value problems; network flows; and optimization.Subjects

Scientific computing: Fast Fourier Transform | Scientific computing: Fast Fourier Transform | finite differences | finite differences | finite elements | finite elements | spectral method | spectral method | numerical linear algebra | numerical linear algebra | Complex variables and applications | Complex variables and applications | Initial-value problems: stability or chaos in ordinary differential equations | Initial-value problems: stability or chaos in ordinary differential equations | wave equation versus heat equation | wave equation versus heat equation | conservation laws and shocks | conservation laws and shocks | dissipation and dispersion | dissipation and dispersion | Optimization: network flows | Optimization: network flows | linear programming | linear programming | Scientific computing: Fast Fourier Transform | finite differences | finite elements | spectral method | numerical linear algebra | Scientific computing: Fast Fourier Transform | finite differences | finite elements | spectral method | numerical linear algebra | Initial-value problems: stability or chaos in ordinary differential equations | wave equation versus heat equation | conservation laws and shocks | dissipation and dispersion | Initial-value problems: stability or chaos in ordinary differential equations | wave equation versus heat equation | conservation laws and shocks | dissipation and dispersion | Optimization: network flows | linear programming | Optimization: network flows | linear programmingLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allavcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata15.099 Readings in Optimization (MIT) 15.099 Readings in Optimization (MIT)

Description

In keeping with the tradition of the last twenty-some years, the Readings in Optimization seminar will focus on an advanced topic of interest to a portion of the MIT optimization community: randomized methods for deterministic optimization. In contrast to conventional optimization algorithms whose iterates are computed and analyzed deterministically, randomized methods rely on stochastic processes and random number/vector generation as part of the algorithm and/or its analysis. In the seminar, we will study some very recent papers on this topic, many by MIT faculty, as well as some older papers from the existing literature that are only now receiving attention. In keeping with the tradition of the last twenty-some years, the Readings in Optimization seminar will focus on an advanced topic of interest to a portion of the MIT optimization community: randomized methods for deterministic optimization. In contrast to conventional optimization algorithms whose iterates are computed and analyzed deterministically, randomized methods rely on stochastic processes and random number/vector generation as part of the algorithm and/or its analysis. In the seminar, we will study some very recent papers on this topic, many by MIT faculty, as well as some older papers from the existing literature that are only now receiving attention.Subjects

deterministic optimization; algorithms; stochastic processes; random number generation; simplex method; nonlinear; convex; complexity analysis; semidefinite programming; heuristic; global optimization; Las Vegas algorithm; randomized algorithm; linear programming; search techniques; hit and run; NP-hard; approximation | deterministic optimization; algorithms; stochastic processes; random number generation; simplex method; nonlinear; convex; complexity analysis; semidefinite programming; heuristic; global optimization; Las Vegas algorithm; randomized algorithm; linear programming; search techniques; hit and run; NP-hard; approximation | deterministic optimization | deterministic optimization | algorithms | algorithms | stochastic processes | stochastic processes | random number generation | random number generation | simplex method | simplex method | nonlinear | nonlinear | convex | convex | complexity analysis | complexity analysis | semidefinite programming | semidefinite programming | heuristic | heuristic | global optimization | global optimization | Las Vegas algorithm | Las Vegas algorithm | randomized algorithm | randomized algorithm | linear programming | linear programming | search techniques | search techniques | hit and run | hit and run | NP-hard | NP-hard | approximation | approximationLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadataDescription

Includes audio/video content: AV selected lectures. This course is about the mathematics that is most widely used in the mechanical engineering core subjects: An introduction to linear algebra and ordinary differential equations (ODEs), including general numerical approaches to solving systems of equations. Includes audio/video content: AV selected lectures. This course is about the mathematics that is most widely used in the mechanical engineering core subjects: An introduction to linear algebra and ordinary differential equations (ODEs), including general numerical approaches to solving systems of equations.Subjects

differential equations | differential equations | linear algebra | linear algebra | linear differential equations | linear differential equations | ordinary | ordinary | partial | partial | vector space | vector space | first order | first order | second order | second order | Heaviside | Heaviside | delta | delta | Dirac | Dirac | exponential | exponential | sinusoid | sinusoid | real | real | complex | complex | forced oscillations | forced oscillations | Laplace transform | Laplace transform | graph | graph | nonlinear | nonlinear | source | source | sink | sink | saddle | saddle | spiral | spiral | Euler | Euler | linearization | linearization | Guassian | Guassian | matrix | matrix | mechanical engineer | mechanical engineer | eigenvector | eigenvector | eigenvalue | eigenvalue | exponentiation | exponentiation | least squares | least squaresLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allavcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata18.335J Introduction to Numerical Methods (MIT) 18.335J Introduction to Numerical Methods (MIT)

Description

This course offers an advanced introduction to numerical linear algebra. Topics include direct and iterative methods for linear systems, eigenvalue decompositions and QR/SVD factorizations, stability and accuracy of numerical algorithms, the IEEE floating point standard, sparse and structured matrices, preconditioning, linear algebra software. Problem sets require some knowledge of MATLAB®. This course offers an advanced introduction to numerical linear algebra. Topics include direct and iterative methods for linear systems, eigenvalue decompositions and QR/SVD factorizations, stability and accuracy of numerical algorithms, the IEEE floating point standard, sparse and structured matrices, preconditioning, linear algebra software. Problem sets require some knowledge of MATLAB®.Subjects

numerical linear algebra | numerical linear algebra | linear systems | linear systems | eigenvalue decomposition | eigenvalue decomposition | QR/SVD factorization | QR/SVD factorization | numerical algorithms | numerical algorithms | IEEE floating point standard | IEEE floating point standard | sparse matrices | sparse matrices | structured matrices | structured matrices | preconditioning | preconditioning | linear algebra software | linear algebra software | Matlab | MatlabLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadataDescription

6.241 examines linear, discrete- and continuous-time, and multi-input-output systems in control and related areas. Least squares and matrix perturbation problems are considered. Topics covered include: state-space models, modes, stability, controllability, observability, transfer function matrices, poles and zeros, minimality, internal stability of interconnected systems, feedback compensators, state feedback, optimal regulation, observers, observer-based compensators, measures of control performance, and robustness issues using singular values of transfer functions. Nonlinear systems are also introduced. 6.241 examines linear, discrete- and continuous-time, and multi-input-output systems in control and related areas. Least squares and matrix perturbation problems are considered. Topics covered include: state-space models, modes, stability, controllability, observability, transfer function matrices, poles and zeros, minimality, internal stability of interconnected systems, feedback compensators, state feedback, optimal regulation, observers, observer-based compensators, measures of control performance, and robustness issues using singular values of transfer functions. Nonlinear systems are also introduced.Subjects

control | control | linear | linear | discrete | discrete | continuous-time | continuous-time | multi-input-output | multi-input-output | least squares | least squares | matrix perturbation | matrix perturbation | state-space models | stability | controllability | observability | transfer function matrices | poles | state-space models | stability | controllability | observability | transfer function matrices | poles | zeros | zeros | minimality | minimality | feedback | feedback | compensators | compensators | state feedback | state feedback | optimal regulation | optimal regulation | observers | transfer functions | observers | transfer functions | nonlinear systems | nonlinear systems | linear systems | linear systemsLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata15.093 Optimization Methods (SMA 5213) (MIT) 15.093 Optimization Methods (SMA 5213) (MIT)

Description

This course introduces the principal algorithms for linear, network, discrete, nonlinear, dynamic optimization and optimal control. Emphasis is on methodology and the underlying mathematical structures. Topics include the simplex method, network flow methods, branch and bound and cutting plane methods for discrete optimization, optimality conditions for nonlinear optimization, interior point methods for convex optimization, Newton's method, heuristic methods, and dynamic programming and optimal control methods. This course was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5213 (Optimisation Methods). This course introduces the principal algorithms for linear, network, discrete, nonlinear, dynamic optimization and optimal control. Emphasis is on methodology and the underlying mathematical structures. Topics include the simplex method, network flow methods, branch and bound and cutting plane methods for discrete optimization, optimality conditions for nonlinear optimization, interior point methods for convex optimization, Newton's method, heuristic methods, and dynamic programming and optimal control methods. This course was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5213 (Optimisation Methods).Subjects

principal algorithms | principal algorithms | linear | linear | network | network | discrete | discrete | nonlinear | nonlinear | dynamic optimization | dynamic optimization | optimal control | optimal control | methodology and the underlying mathematical structures | methodology and the underlying mathematical structures | simplex method | simplex method | network flow methods | network flow methods | branch and bound and cutting plane methods for discrete optimization | branch and bound and cutting plane methods for discrete optimization | optimality conditions for nonlinear optimization | optimality conditions for nonlinear optimization | interior point methods for convex optimization | interior point methods for convex optimization | Newton's method | Newton's method | heuristic methods | heuristic methods | dynamic programming | dynamic programming | optimal control methods | optimal control methods | SMA 5213 | SMA 5213License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata12.520 Geodynamics (MIT) 12.520 Geodynamics (MIT)

Description

This course deals with mechanics of deformation of the crust and mantle, with emphasis on the importance of different rheological descriptions: brittle, elastic, linear and nonlinear fluids, and viscoelastic. This course deals with mechanics of deformation of the crust and mantle, with emphasis on the importance of different rheological descriptions: brittle, elastic, linear and nonlinear fluids, and viscoelastic.Subjects

Geodynamics | Geodynamics | mechanics of deformation | mechanics of deformation | crust | crust | mantle | mantle | rheological descriptions | rheological descriptions | brittle | brittle | elastic | elastic | linear | linear | nonlinear fluids | nonlinear fluids | viscoelastic | viscoelastic | surface tractions | surface tractions | tectonic stress | tectonic stress | quantity expression | quantity expression | stress variations | stress variations | sandbox tectonics | sandbox tectonics | displacement gradients | displacement gradients | strains | strains | rotations | rotations | finite strain | finite strain | motivation | motivation | dislocation | dislocation | plates | plates | topography | topography | rock rheology | rock rheology | accretionary wedge | accretionary wedge | linear fluids | linear fluids | elastic models | elastic models | newtonian fluids | newtonian fluids | stream function | stream function | Rayleigh-Taylor instability | Rayleigh-Taylor instability | diapirism | diapirism | diapirs | diapirs | plumes | plumes | corner flow | corner flow | power law creep | power law creep | viscoelasticity | viscoelasticity | porous media | porous media | Elsasser model | Elsasser model | time dependent porous flow | time dependent porous flowLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadataDescription

This course is the second of a two-term sequence with 6.450. The focus is on coding techniques for approaching the Shannon limit of additive white Gaussian noise (AWGN) channels, their performance analysis, and design principles. After a review of 6.450 and the Shannon limit for AWGN channels, the course begins by discussing small signal constellations, performance analysis and coding gain, and hard-decision and soft-decision decoding. It continues with binary linear block codes, Reed-Muller codes, finite fields, Reed-Solomon and BCH codes, binary linear convolutional codes, and the Viterbi algorithm.More advanced topics include trellis representations of binary linear block codes and trellis-based decoding; codes on graphs; the sum-product and min-sum algorithms This course is the second of a two-term sequence with 6.450. The focus is on coding techniques for approaching the Shannon limit of additive white Gaussian noise (AWGN) channels, their performance analysis, and design principles. After a review of 6.450 and the Shannon limit for AWGN channels, the course begins by discussing small signal constellations, performance analysis and coding gain, and hard-decision and soft-decision decoding. It continues with binary linear block codes, Reed-Muller codes, finite fields, Reed-Solomon and BCH codes, binary linear convolutional codes, and the Viterbi algorithm.More advanced topics include trellis representations of binary linear block codes and trellis-based decoding; codes on graphs; the sum-product and min-sum algorithmsSubjects

coding techniques | coding techniques | the Shannon limit of additive white Gaussian noise channels | the Shannon limit of additive white Gaussian noise channels | performance analysis | performance analysis | Small signal constellations | Small signal constellations | coding gain | coding gain | Hard-decision and soft-decision decoding | Hard-decision and soft-decision decoding | Introduction to binary linear block codes | Introduction to binary linear block codes | Reed-Muller codes | Reed-Muller codes | finite fields | finite fields | Reed-Solomon and BCH codes | Reed-Solomon and BCH codes | binary linear convolutional codes | binary linear convolutional codes | Viterbi and BCJR algorithms | Viterbi and BCJR algorithms | Trellis representations of binary linear block codes | Trellis representations of binary linear block codes | trellis-based ML decoding | trellis-based ML decoding | Codes on graphs | Codes on graphs | sum-product | sum-product | max-product | max-product | decoding algorithms | decoding algorithms | Turbo codes | Turbo codes | LDPC codes and RA codes | LDPC codes and RA codes | Coding for the bandwidth-limited regime | Coding for the bandwidth-limited regime | Lattice codes | Lattice codes | Trellis-coded modulation | Trellis-coded modulation | Multilevel coding | Multilevel coding | Shaping | ShapingLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata18.311 Principles of Applied Mathematics (MIT) 18.311 Principles of Applied Mathematics (MIT)

Description

Discussion of computational and modeling issues. Nonlinear dynamical systems; nonlinear waves; diffusion; stability; characteristics; nonlinear steepening, breaking and shock formation; conservation laws; first-order partial differential equations; finite differences; numerical stability; etc. Applications to traffic problems, flows in rivers, internal waves, mechanical vibrations and other problems in the physical world.Technical RequirementsMATLAB® software is required to run the .m files found on this course site. MATLAB® is a trademark of The MathWorks, Inc. Discussion of computational and modeling issues. Nonlinear dynamical systems; nonlinear waves; diffusion; stability; characteristics; nonlinear steepening, breaking and shock formation; conservation laws; first-order partial differential equations; finite differences; numerical stability; etc. Applications to traffic problems, flows in rivers, internal waves, mechanical vibrations and other problems in the physical world.Technical RequirementsMATLAB® software is required to run the .m files found on this course site. MATLAB® is a trademark of The MathWorks, Inc.Subjects

Nonlinear dynamical systems | Nonlinear dynamical systems | nonlinear waves | nonlinear waves | diffusion | diffusion | stability | stability | characteristics | characteristics | nonlinear steepening | nonlinear steepening | breaking and shock formation | breaking and shock formation | conservation laws | conservation laws | first-order partial differential equations | first-order partial differential equations | finite differences | finite differences | numerical stability | numerical stability | traffic problems | traffic problems | flows in rivers | flows in rivers | internal waves | internal waves | mechanical vibrations | mechanical vibrationsLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadataDescription

Includes audio/video content: AV lectures. This course is the second of a two-term sequence with 6.450. The focus is on coding techniques for approaching the Shannon limit of additive white Gaussian noise (AWGN) channels, their performance analysis, and design principles. After a review of 6.450 and the Shannon limit for AWGN channels, the course begins by discussing small signal constellations, performance analysis and coding gain, and hard-decision and soft-decision decoding. It continues with binary linear block codes, Reed-Muller codes, finite fields, Reed-Solomon and BCH codes, binary linear convolutional codes, and the Viterbi algorithm. More advanced topics include trellis representations of binary linear block codes and trellis-based decoding; codes on graphs; the sum-product and Includes audio/video content: AV lectures. This course is the second of a two-term sequence with 6.450. The focus is on coding techniques for approaching the Shannon limit of additive white Gaussian noise (AWGN) channels, their performance analysis, and design principles. After a review of 6.450 and the Shannon limit for AWGN channels, the course begins by discussing small signal constellations, performance analysis and coding gain, and hard-decision and soft-decision decoding. It continues with binary linear block codes, Reed-Muller codes, finite fields, Reed-Solomon and BCH codes, binary linear convolutional codes, and the Viterbi algorithm. More advanced topics include trellis representations of binary linear block codes and trellis-based decoding; codes on graphs; the sum-product andSubjects

coding techniques | coding techniques | the Shannon limit of additive white Gaussian noise channels | the Shannon limit of additive white Gaussian noise channels | performance analysis | performance analysis | Small signal constellations | Small signal constellations | coding gain | coding gain | Hard-decision and soft-decision decoding | Hard-decision and soft-decision decoding | Introduction to binary linear block codes | Introduction to binary linear block codes | Reed-Muller codes | Reed-Muller codes | finite fields | finite fields | Reed-Solomon and BCH codes | Reed-Solomon and BCH codes | binary linear convolutional codes | binary linear convolutional codes | Viterbi and BCJR algorithms | Viterbi and BCJR algorithms | Trellis representations of binary linear block codes | Trellis representations of binary linear block codes | trellis-based ML decoding | trellis-based ML decoding | Codes on graphs | Codes on graphs | sum-product | sum-product | max-product | max-product | decoding algorithms | decoding algorithms | Turbo codes | Turbo codes | LDPC codes and RA codes | LDPC codes and RA codes | Coding for the bandwidth-limited regime | Coding for the bandwidth-limited regime | Lattice codes. | Lattice codes. | Trellis-coded modulation | Trellis-coded modulation | Multilevel coding | Multilevel coding | Shaping | Shaping | Lattice codes | Lattice codesLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allavcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadataDescription

This course is a comprehensive introduction to control system synthesis in which the digital computer plays a major role, reinforced with hands-on laboratory experience. The course covers elements of real-time computer architecture; input-output interfaces and data converters; analysis and synthesis of sampled-data control systems using classical and modern (state-space) methods; analysis of trade-offs in control algorithms for computation speed and quantization effects. Laboratory projects emphasize practical digital servo interfacing and implementation problems with timing, noise, and nonlinear devices. This course is a comprehensive introduction to control system synthesis in which the digital computer plays a major role, reinforced with hands-on laboratory experience. The course covers elements of real-time computer architecture; input-output interfaces and data converters; analysis and synthesis of sampled-data control systems using classical and modern (state-space) methods; analysis of trade-offs in control algorithms for computation speed and quantization effects. Laboratory projects emphasize practical digital servo interfacing and implementation problems with timing, noise, and nonlinear devices.Subjects

digital computer | digital computer | computation | computation | real-time computer | real-time computer | input-output | input-output | I/O | I/O | interface | interface | data converter | data converter | A/D converter | A/D converter | sampling | sampling | state-space | state-space | algorithm | algorithm | quantization | quantization | servo | servo | timing | timing | noise | noise | nonlinear | nonlinear | nonlinearity | nonlinearity | non-linear | non-linearLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata6.977 Ultrafast Optics (MIT) 6.977 Ultrafast Optics (MIT)

Description

This course is offered to graduate students and addresses issues regarding ultrafast optics. Topics covered include: Generation, propagation and applications of ultrashort pulses (nano-, pico-, femto-, attosecond pulses); Linear and nonlinear pulse shaping processes: Optical solitons, Pulse compression; Laser principles: Single- and multi-mode laser dynamics, Q-switching, Active and passive mode-locking; Pulse characterization: Autocorrelation, FROG, SPIDER; Noise in mode-locked lasers and its limitations in measurements; Laser amplifiers, optical parametric amplifiers, and oscillators; Applications in research and industry: Pump-probe techniques, Optical imaging, Frequency metrology, Laser ablation, High harmonic generation. This course is offered to graduate students and addresses issues regarding ultrafast optics. Topics covered include: Generation, propagation and applications of ultrashort pulses (nano-, pico-, femto-, attosecond pulses); Linear and nonlinear pulse shaping processes: Optical solitons, Pulse compression; Laser principles: Single- and multi-mode laser dynamics, Q-switching, Active and passive mode-locking; Pulse characterization: Autocorrelation, FROG, SPIDER; Noise in mode-locked lasers and its limitations in measurements; Laser amplifiers, optical parametric amplifiers, and oscillators; Applications in research and industry: Pump-probe techniques, Optical imaging, Frequency metrology, Laser ablation, High harmonic generation.Subjects

ultrafast optics | ultrafast optics | generation | generation | propagation | propagation | ultrashort pulses | ultrashort pulses | nanopulses | nanopulses | picopulses | picopulses | femtopulses | femtopulses | attosecond pulses | attosecond pulses | linear | linear | non-linear | non-linear | effects | effects | high precision | high precision | measurements | measurements | nonlinear optics | nonlinear optics | optical signal processing | optical signal processing | optical communications | optical communications | x-ray generation | x-ray generationLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allcourses-6.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata6.243J Dynamics of Nonlinear Systems (MIT) 6.243J Dynamics of Nonlinear Systems (MIT)

Description

This course provides an introduction to nonlinear deterministic dynamical systems. Topics covered include: nonlinear ordinary differential equations; planar autonomous systems; fundamental theory: Picard iteration, contraction mapping theorem, and Bellman-Gronwall lemma; stability of equilibria by Lyapunov's first and second methods; feedback linearization; and application to nonlinear circuits and control systems. This course provides an introduction to nonlinear deterministic dynamical systems. Topics covered include: nonlinear ordinary differential equations; planar autonomous systems; fundamental theory: Picard iteration, contraction mapping theorem, and Bellman-Gronwall lemma; stability of equilibria by Lyapunov's first and second methods; feedback linearization; and application to nonlinear circuits and control systems.Subjects

nonlinear systems | nonlinear systems | deterministic dynamical systems | deterministic dynamical systems | ordinary differential equations | ordinary differential equations | planar autonomous systems | planar autonomous systems | Picard iteration | Picard iteration | contraction mapping theorem | contraction mapping theorem | Bellman-Gronwall lemma | Bellman-Gronwall lemma | Lyapunov methods | Lyapunov methods | feedback linearization | feedback linearization | nonlinear circuits | nonlinear circuits | control systems | control systems | local controllability | local controllability | volume evolution | volume evolution | system analysis | system analysis | singular perturbations | singular perturbations | averaging | averaging | local behavior | local behavior | trajectories | trajectories | equilibria | equilibria | storage functions | storage functions | stability analysis | stability analysis | continuity | continuity | differential equations | differential equations | system models | system models | parameters | parameters | input/output | input/output | state-space | state-space | 16.337 | 16.337License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allcourses-transportation.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata6.252J Nonlinear Programming (MIT) 6.252J Nonlinear Programming (MIT)

Description

6.252J is a course in the department's "Communication, Control, and Signal Processing" concentration. This course provides a unified analytical and computational approach to nonlinear optimization problems. The topics covered in this course include: unconstrained optimization methods, constrained optimization methods, convex analysis, Lagrangian relaxation, nondifferentiable optimization, and applications in integer programming. There is also a comprehensive treatment of optimality conditions, Lagrange multiplier theory, and duality theory. Throughout the course, applications are drawn from control, communications, power systems, and resource allocation problems. 6.252J is a course in the department's "Communication, Control, and Signal Processing" concentration. This course provides a unified analytical and computational approach to nonlinear optimization problems. The topics covered in this course include: unconstrained optimization methods, constrained optimization methods, convex analysis, Lagrangian relaxation, nondifferentiable optimization, and applications in integer programming. There is also a comprehensive treatment of optimality conditions, Lagrange multiplier theory, and duality theory. Throughout the course, applications are drawn from control, communications, power systems, and resource allocation problems.Subjects

nonlinear programming | nonlinear programming | non-linear programming | non-linear programming | nonlinear optimization | nonlinear optimization | unconstrained optimization | unconstrained optimization | gradient | gradient | conjugate direction | conjugate direction | Newton | Newton | quasi-Newton methods | quasi-Newton methods | constrained optimization | constrained optimization | feasible directions | feasible directions | projection | projection | interior point | interior point | Lagrange multiplier | Lagrange multiplier | convex analysis | convex analysis | Lagrangian relaxation | Lagrangian relaxation | nondifferentiable optimization | nondifferentiable optimization | integer programming | integer programming | optimality conditions | optimality conditions | Lagrange multiplier theory | Lagrange multiplier theory | duality theory | duality theory | control | control | communications | communications | power systems | power systems | resource allocation | resource allocation | 6.252 | 6.252 | 15.084 | 15.084License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allcourses-6.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata18.701 Algebra I (MIT) 18.701 Algebra I (MIT)

Description

This undergraduate level Algebra I course covers groups, vector spaces, linear transformations, symmetry groups, bilinear forms, and linear groups. This undergraduate level Algebra I course covers groups, vector spaces, linear transformations, symmetry groups, bilinear forms, and linear groups.Subjects

Group Theory | Group Theory | Linear Algebra | Linear Algebra | Geometry | Geometry | groups | groups | vector spaces | vector spaces | linear transformations | linear transformations | symmetry groups | symmetry groups | bilinear forms | bilinear forms | linear groups | linear groupsLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata18.335J Introduction to Numerical Methods (MIT) 18.335J Introduction to Numerical Methods (MIT)

Description

This course offers an advanced introduction to numerical linear algebra. Topics include direct and iterative methods for linear systems, eigenvalue decompositions and QR/SVD factorizations, stability and accuracy of numerical algorithms, the IEEE floating point standard, sparse and structured matrices, preconditioning, linear algebra software. Problem sets require some knowledge of MATLAB®. This course offers an advanced introduction to numerical linear algebra. Topics include direct and iterative methods for linear systems, eigenvalue decompositions and QR/SVD factorizations, stability and accuracy of numerical algorithms, the IEEE floating point standard, sparse and structured matrices, preconditioning, linear algebra software. Problem sets require some knowledge of MATLAB®.Subjects

numerical linear algebra | numerical linear algebra | linear systems | linear systems | eigenvalue decomposition | eigenvalue decomposition | QR/SVD factorization | QR/SVD factorization | numerical algorithms | numerical algorithms | IEEE floating point standard | IEEE floating point standard | sparse matrices | sparse matrices | structured matrices | structured matrices | preconditioning | preconditioning | linear algebra software | linear algebra software | Matlab | MatlabLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata18.034 Honors Differential Equations (MIT) 18.034 Honors Differential Equations (MIT)

Description

This course covers the same material as 18.03 with more emphasis on theory. Topics include first order equations, separation, initial value problems, systems, linear equations, independence of solutions, undetermined coefficients, and singular points and periodic orbits for planar systems. This course covers the same material as 18.03 with more emphasis on theory. Topics include first order equations, separation, initial value problems, systems, linear equations, independence of solutions, undetermined coefficients, and singular points and periodic orbits for planar systems.Subjects

First order equations | First order equations | Separation | Separation | initial value problems | initial value problems | Systems | Systems | linear equations | linear equations | independence of solutions | independence of solutions | undetermined coefficients | undetermined coefficients | Singular points | Singular points | periodic orbits for planar systems | periodic orbits for planar systems | first order ode's | first order ode's | second order ode's | second order ode's | fourier series | fourier series | laplace transform | laplace transform | linear systems | linear systems | nonlinear systems | nonlinear systems | constant coefficients | constant coefficientsLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadataMAS.622J Pattern Recognition and Analysis (MIT) MAS.622J Pattern Recognition and Analysis (MIT)

Description

This class deals with the fundamentals of characterizing and recognizing patterns and features of interest in numerical data. We discuss the basic tools and theory for signal understanding problems with applications to user modeling, affect recognition, speech recognition and understanding, computer vision, physiological analysis, and more. We also cover decision theory, statistical classification, maximum likelihood and Bayesian estimation, nonparametric methods, unsupervised learning and clustering. Additional topics on machine and human learning from active research are also talked about in the class. This class deals with the fundamentals of characterizing and recognizing patterns and features of interest in numerical data. We discuss the basic tools and theory for signal understanding problems with applications to user modeling, affect recognition, speech recognition and understanding, computer vision, physiological analysis, and more. We also cover decision theory, statistical classification, maximum likelihood and Bayesian estimation, nonparametric methods, unsupervised learning and clustering. Additional topics on machine and human learning from active research are also talked about in the class.Subjects

MAS.622 | MAS.622 | 1.126 | 1.126 | pattern recognition | pattern recognition | feature detection | feature detection | classification | classification | probability theory | probability theory | pattern analysis | pattern analysis | conditional probability | conditional probability | bayes rule | bayes rule | random vectors | decision theory | random vectors | decision theory | ROC curves | ROC curves | likelihood ratio test | likelihood ratio test | fisher discriminant | fisher discriminant | template-based recognition | template-based recognition | feature extraction | feature extraction | eigenvector and multilinear analysis | eigenvector and multilinear analysis | linear discriminant | linear discriminant | perceptron learning | perceptron learning | optimization by gradient descent | optimization by gradient descent | support vecotr machines | support vecotr machines | K-nearest-neighbor classification | K-nearest-neighbor classification | parzen estimation | parzen estimation | unsupervised learning | unsupervised learning | clustering | clustering | vector quantization | vector quantization | K-means | K-means | Expectation-Maximization | Expectation-Maximization | Hidden markov models | Hidden markov models | viterbi algorithm | viterbi algorithm | Baum-Welch algorithm | Baum-Welch algorithm | linear dynamical systems | linear dynamical systems | Kalman filtering | Kalman filtering | Bayesian networks | Bayesian networks | decision trees | decision trees | reinforcement learning | reinforcement learning | genetic algorithms | genetic algorithmsLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allcourses-MAS.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata18.700 Linear Algebra (MIT) 18.700 Linear Algebra (MIT)

Description

This course offers a rigorous treatment of linear algebra, including vector spaces, systems of linear equations, bases, linear independence, matrices, determinants, eigenvalues, inner products, quadratic forms, and canonical forms of matrices. Compared with Linear Algebra (18.06), more emphasis is placed on theory and proofs. This course offers a rigorous treatment of linear algebra, including vector spaces, systems of linear equations, bases, linear independence, matrices, determinants, eigenvalues, inner products, quadratic forms, and canonical forms of matrices. Compared with Linear Algebra (18.06), more emphasis is placed on theory and proofs.Subjects

linear algebra | linear algebra | vector space | vector space | system of linear equations | system of linear equations | bases | bases | linear independence | linear independence | matrices | matrices | matrix | matrix | determinant | determinant | eigenvalue | eigenvalue | inner product | inner product | quadratic form | quadratic form | canonical form | canonical formLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata