Till KTH:s startsida Till KTH:s startsida

Nyhetsflöde

Logga in till din gruppwebb

Du är inte inloggad på KTH så innehållet är inte anpassat efter dina val.

Du är inte inloggad. för att delta i diskussionen.

Nedan är de senaste inläggen, kommentarerna, redigeringarna osv. De med senaste aktivitet kommer först.

Oktober 2016
Elias Jarlebring skrev inlägget 3 oktober 2016
Elias Jarlebring korrigerade 3 oktober 2016

Course Announcement: SF3580 PhD level course in numerical linear algebra

The PhD-level course "Numerical linear algebra" will be offered this term starting in November 2016. This course is primarily intended for PhD students in the graduate program Applied and Computational Mathematics at KTH, and anyone with a background in mathematics, applied mathematics and/or computation is certainly welcome to participate.

If you are interested in participating: P, please,


* send an email to me with your name and personnummer, and
* go to the news feed of the course SF2524 and click follow / subscribe
The course is a superset of the master-level course SF2524 in the sense of homework and lectures. The first lecture is on November 1. Additional lectures only for SF3580 will take place in January. If you are a PhD student and attended SF2524 when you were a master-student, special rules will apply.

The course focus is on theory and computation for algorithms in numerical linear algebra, in particular eigenvalue problems (Krylov methods, QR-method, structured methods), linear systems of equations (GMRES, CG, BiCG), matrix functions (matrix exponential, Schur-Parlett method, Krylov methods, exponential integrators), matrix equations (Lyapunov/Sylester equation, Bartel-Stewart algorithm, KPIK).

The course will contain one individual project either closely related to the material of the course, or the research of the student.

More information can be found on http://people.kth.se/~eliasj/NLA/

Welcome!

Elias Jarlebring korrigerade 3 oktober 2016

Course Announcement: SF3580 PhD level course in numerical linear algebra

The PhD-level course "Numerical linear algebra" will be offered this term starting in November 2016. This course is primarily intended for PhD students in the graduate program Applied and Computational Mathematics at KTH, and anyone with a background in mathematics, applied mathematics and/or computation is certainly welcome to participate.

If you are interested in participating, please,


* send an email to me with your name and personnummer, and
* go to the news feed of the course SF2524 and click follow / subscribe.
The course is a superset of the master-level course SF2524 in the sense of homework and lectures. The first lecture is on November 1. Additional lectures only for SF3580 will take place in January. If you are a PhD student and attended SF2524 when you were a master-student, special rules will apply.

The course focus is on theory and computation for algorithms in numerical linear algebra, in particular eigenvalue problems (Krylov methods, QR-method, structured methods), linear systems of equations (GMRES, CG, BiCG), matrix functions (matrix exponential, Schur-Parlett method, Krylov methods, exponential integrators), matrix equations (Lyapunov/Sylester equation, Bartel-Stewart algorithm, KPIK).

The course will contain one individual project either closely related to the material of the course, or the research of the student.

More information can be found on http://people.kth.se/~eliasj/NLA/

Welcome!

Elias Jarlebring korrigerade 3 oktober 2016

Course Announcement: SF3580 PhD level course in numerical linear algebra

The PhD-level course "Numerical linear algebra" will be offered this term starting in November 2016. This course is primarily intended for PhD students in the graduate program Applied and Computational Mathematics at KTH, and anyone with a background in mathematics, applied mathematics and/or computation is certainly welcome to participate.

If you are interested in participating, please,


* send an email to me with your name and personnummer, and
* go to the news feed of the course SF2524 and click follow / subscribe.
The course is a superset of the master-level course SF2524 in the sense of homework and lectures. The first lecture is on November 1. Additional lectures only for SF3580 will take place in January. If you are a PhD student and attended SF2524 when you were a master-student, special rules will apply.

The course focus is on theory and computation for algorithms in numerical linear algebra, in particular eigenvalue problems (Krylov methods, QR-method, structured methods), linear systems of equations (GMRES, CG, BiCG), matrix functions (matrix exponential, Schur-Parlett method, Krylov methods, exponential integrators), matrix equations (Lyapunov/Sylester equation, Bartel-Stewart algorithm, KPIK). PhD students are expected to complete the homework in the programming language julia.

The course will contain one individual project either closely related to the material of the course, or the research of the student.

More information can be found on http://people.kth.se/~eliasj/NLA/

Welcome!

Elias Jarlebring ändrade rättigheterna 3 oktober 2016

Kan därmed läsas av alla och ändras av elias jarlebring (eliasj@kth.se).
Elias Jarlebring korrigerade 3 oktober 2016

Course Announcement: SF3580 PhD level course in numerical linear algebra

The PhD-level course "Numerical linear algebra" will be offered this term starting in November 2016. This course is primarily intended for PhD students in the graduate program Applied and Computational Mathematics at KTH, and anyone with a background in mathematics, applied mathematics and/or computation is certainly welcome to participate.

If you are interested in participating, please,


* send an email to me with your name and personnummer, and
* go to the news feed of the course SF2524 and click follow / subscribe.
The course is a superset of the master-level course SF2524 in the sense of homework and lectures. The first lecture is on November 1. Additional lectures only for SF3580 will take place in January. If you are a PhD student and attended SF2524 when you were a master-student, special rules will apply.

The course focus is on theory and computation for algorithms in numerical linear algebra, in particular eigenvalue problems (Krylov methods, QR-method, structured methods), linear systems of equations (GMRES, CG, BiCG), matrix functions (matrix exponential, Schur-Parlett method, Krylov methods, exponential integrators), matrix equations (Lyapunov/Sylester equation, Bartel-Stewart algorithm, KPIK). PhD students are expected to complete the programming tasks of homework in the programming language julia.

The course will contain one individual project either closely related to the material of the course, or the research of the student.

More information can be found on http://people.kth.se/~eliasj/NLA/

Welcome!

 
December 2015
Elias Jarlebring skrev inlägget 10 december 2015
 
Augusti 2014
Anders Forsgren skrev inlägget 25 augusti 2014
Anders Forsgren korrigerade 25 augusti 2014

Graduate course SF3840 Numerical nonlinear programming I will be giving the graduate course "SF3840 Numerical nonlinear programming" in the autumn of 2014. This course is primarily intended for graduate students in optimization and systems theory, or other graduate students with a good background in optimization.

First lecture will be held Wednesday September 3, 13.15-15.00 in Room 3733, Lindstedtsvägen 25.

For more information, see http://www.math.kth.se/optsyst/forskning/forskarutbildning/SF3840/ Best regards, Anders

Anders Forsgren korrigerade 25 augusti 2014

Graduate course SF3840 Numerical nonlinear programming I will be giving the graduate course "SF3840 Numerical nonlinear programming" in the autumn of 2014. This course is primarily intended for graduate students in optimization and systems theory, or other graduate students with a good background in optimization.

First lecture will be held Wednesday September 3, 13.15-15.00 in Room 3733, Lindstedtsvägen 25.

For more information, see http://www.math.kth.se/optsyst/forskning/forskarutbildning/SF3840/ Best regards, Anders

 
Maj 2013
Anders Forsgren skrev inlägget 15 maj 2013
 
Augusti 2012
Administratör Henrik Hult skrev inlägget 24 augusti 2012
 
Administratör Henrik Hult skrev inlägget 23 augusti 2012
 
Administratör Henrik Hult skrev inlägget 22 augusti 2012

Administratör Henrik Hult ändrade rättigheterna 22 augusti 2012

Kan därmed läsas av alla och ändras av henrik hult (hult@kth.se).
 
April 2012
Administratör Henrik Hult skrev inlägget 23 april 2012
 
Januari 2012
Tobias Mömke skrev inlägget 31 januari 2012
Tobias Mömke korrigerade 31 januari 2012

COURSE ANNOUNCEMENT: COMBINATORIAL OPTIMIZATION

Hi all,

Starting February 15, I will give the following Course:

Combinatorial Optimization

The course aims to give a foundation of advanced techniques that lead to efficient exactalgorithms. After an introduction to fundamental polyhedral concepts such asinteger polyhedra and their connection to totally unimodular matrices, thecourse focuses on matroids and their connection to greedy algorithms. The lastpart of the course introduces expander graphs from a combinatorial optimizationpoint of view.The course website ishttp://www.csc.kth.se/~moemke/co12/index.html The main resource for the course will be the book"Combinatorial Optimization: Polyhedra and Efficiency" written by Alexander Schrijver.There are, however, sufficient alternative resources available. Best regards,

Tobias Mömke

Address:  Room 1419, Floor 4, Osquars backe 2Phone: +46 (0) 8 790 6286Webpage: http://www.csc.kth.se/~moemke/

¶ ¶

Tobias Mömke korrigerade 31 januari 2012

COURSE ANNOUNCEMENT: COMBINATORIAL OPTIMIZATION



Hi all,

Starting February 15, I will give the following Course:

Combinatorial Optimization

The course aims to give a foundation of advanced techniques that lead to efficient exactalgorithms. After an introduction to fundamental polyhedral concepts such asinteger polyhedra and their connection to totally unimodular matrices, thecourse focuses on matroids and their connection to greedy algorithms. The lastpart of the course introduces expander graphs from a combinatorial optimizationpoint of view.The course website ishttp://www.csc.kth.se/~moemke/co12/index.html The main resource for the course will be the book"Combinatorial Optimization: Polyhedra and Efficiency" written by Alexander Schrijver.There are, however, sufficient alternative resources available. Best regards,

Tobias Mömke

Address: Room 1419, Floor 4, Osquars backe 2Phone: +46 (0) 8 790 6286Webpage: http://www.csc.kth.se/~moemke/

Tobias Mömke korrigerade 31 januari 2012

COURSE ANNOUNCEMENT: COMBINATORIAL OPTIMIZATION

Hi all,

Starting February 15, I will give the following Course:

Combinatorial Optimization

The course aims to give a foundation of advanced techniques that lead to efficient exactalgorithms. After an introduction to fundamental polyhedral concepts such asinteger polyhedra and their connection to totally unimodular matrices, thecourse focuses on matroids and their connection to greedy algorithms. The lastpart of the course introduces expander graphs from a combinatorial optimizationpoint of view.The course website is http://www.csc.kth.se/~moemke/co12/index.html The main resource for the course will be the book "Combinatorial Optimization: Polyhedra and Efficiency" written by Alexander Schrijver.There are, however, sufficient alternative resources available. Best regards,

Tobias Mömke

Address: Room 1419, Floor 4, Osquars backe 2Phone: +46 (0) 8 790 6286Webpage: http://www.csc.kth.se/~moemke/

 
September 2011
Jakob Nordström skrev inlägget 23 september 2011
Jakob Nordström korrigerade 23 september 2011

Hi all,

Anders Forsgren suggested that I post this announcement here, so here goes.

I just wanted to let you know, with somewhat short forward notice, about a course in theoretical computer science with some fun math titled "Current Research in Proof Complexity". This course will start in late October/early November and run through the winter.

A brief summary of the course follows below. More info can be found at the course webpage www.csc.kth.se/~jakobn/teaching/proofcplx11.

Please drop me a line to jakobn at kth dot se if you are interested in taking the course (and to vote on the schedule, which is currently being determined by a Doodle poll). Also, feel free to contact me (by e-mail, phone or in person — see below) if you have any questions.

The course will be given in periods 2 and 3. There will probably be an average of one two-hour lecture a week, but some weeks will have two lectures and some weeks none due to travelling.

This course is open to anyone, but the main target audience are grad students and advanced undergrads. Some background in computational complexity theory and/or discrete mathematics will probably be helpful, but all that should really be needed is "mathematical maturity" and a willingness to learn new stuff. Although there are no real formal prerequisites, it should be noted that this will probably be a somewhat demanding course (but hopefully even more fun).

Very simply put, proof complexity can be said to be the study of how to provide a short and efficiently verifiable certificate of the fact that a given propositional logic formula is unsatisfiable. Note that for satisfiable formulas there are very succinct certificates — just list a satisfying assignment — but for unsatisfiable formulas it is not quite clear what to do.

It is widely believed that it is not possible in general to give short certificates for unsatisfiable formulas, which if proven would imply P ≠ NP. One important research direction in proof complexity is to approach this distant goal by establishing lower bounds for stronger and stronger proof systems.

Another reason to study proof complexity is to understand the potential and limitations of algorithms for the satisfiability problem (SAT solvers), which typically use some proof system to deduce whether the formula is satisfiable or unsatisfiable. The course will have a slight bias towards this second reason, and will therefore focus on proof systems that are especially interesting from a SAT solving perspective.

With best regards,Jakob NordströmJakob Nordström, KTH Royal Institute of TechnologyAddress: KTH CSC, Osquars backe 2, office 4420, 100 44 Stockholm, SwedenPhone: +46 8 790 62 42 (office), +46 70 742 21 98 (cell)Webpage: http://www.csc.kth.se/~jakobn/