Табела 9.1. Научне, уметничке и стручне квалификације наставника и задужења у настави

 

Име, средње слово, презиме

Љиљана Петковић

Звање

 

Назив институције у  којој наставник ради са пуним радним временом и од када

 

Ужа научна односно уметничка област

 

Академска каријера

 

Година

Институција

Област

Избор у звање

 

 

 

Докторат

 

 

 

Специјализација

 

 

 

Магистратура

 

 

 

Диплома

 

 

 

Списак предмета које наставник држи на студијама првог и другог нивоа

 

назив предмета  

 

Назив студијског програма, врста студја

Часова активне наставе

1.

Нумерички алгоритми линеарне алгебре

 

60

2.

Методе коначних елемената

 

60

Репрезентативне референце (минимално 5 не више од 10)

  1.  

Complex interval arithmetic and its applications. Wiley-VCH, Berlin 1998

On the $k$-th root in circular arithmetic. Computing 33(1984), 27-35.

On some applications of circular complex functions. Computing 41(1989), 141-148.

Efficient iterative algorithms for bounding the inverse of a matrix. Computing 44(1990), 237-244.

Generalized Ostrowski’s root-finding method. Appl. Math. Comput. 57(1993), 2-3.

On the construction of simultaneous methods for multiple zeros. Nonlinear Analysis 30 (1997), 669-676.

Laguerre-like methods for the simultaneous approximation of polynomial zeros. Computing 15(2001), 189-210.

Schroeder-like methods for the simultaneous inclusion of polynomial zeros. Computing 16(2002), 185-199.

Interval root-finding methods of Laguerre-like type. Computing 16 (2002), 199-211.

Weierstrass-like methods with corrections for the inclusion of polynomial zeros. Computing 75(2005), 55-69.

  1.  

Complex interval arithmetic and its applications. Wiley-VCH, Berlin 1998

On the $k$-th root in circular arithmetic. Computing 33(1984), 27-35.

On some applications of circular complex functions. Computing 41(1989), 141-148.

Efficient iterative algorithms for bounding the inverse of a matrix. Computing 44(1990), 237-244.

Generalized Ostrowski’s root-finding method. Appl. Math. Comput. 57(1993), 2-3.

On the construction of simultaneous methods for multiple zeros. Nonlinear Analysis 30 (1997), 669-676.

Laguerre-like methods for the simultaneous approximation of polynomial zeros. Computing 15(2001), 189-210.

Schroeder-like methods for the simultaneous inclusion of polynomial zeros. Computing 16(2002), 185-199.

Interval root-finding methods of Laguerre-like type. Computing 16 (2002), 199-211.

Weierstrass-like methods with corrections for the inclusion of polynomial zeros. Computing 75(2005), 55-69.

  1.  

Complex interval arithmetic and its applications. Wiley-VCH, Berlin 1998

On the $k$-th root in circular arithmetic. Computing 33(1984), 27-35.

On some applications of circular complex functions. Computing 41(1989), 141-148.

Efficient iterative algorithms for bounding the inverse of a matrix. Computing 44(1990), 237-244.

Generalized Ostrowski’s root-finding method. Appl. Math. Comput. 57(1993), 2-3.

On the construction of simultaneous methods for multiple zeros. Nonlinear Analysis 30 (1997), 669-676.

Laguerre-like methods for the simultaneous approximation of polynomial zeros. Computing 15(2001), 189-210.

Schroeder-like methods for the simultaneous inclusion of polynomial zeros. Computing 16(2002), 185-199.

Interval root-finding methods of Laguerre-like type. Computing 16 (2002), 199-211.

Weierstrass-like methods with corrections for the inclusion of polynomial zeros. Computing 75(2005), 55-69.

  1.  

Complex interval arithmetic and its applications. Wiley-VCH, Berlin 1998

On the $k$-th root in circular arithmetic. Computing 33(1984), 27-35.

On some applications of circular complex functions. Computing 41(1989), 141-148.

Efficient iterative algorithms for bounding the inverse of a matrix. Computing 44(1990), 237-244.

Generalized Ostrowski’s root-finding method. Appl. Math. Comput. 57(1993), 2-3.

On the construction of simultaneous methods for multiple zeros. Nonlinear Analysis 30 (1997), 669-676.

Laguerre-like methods for the simultaneous approximation of polynomial zeros. Computing 15(2001), 189-210.

Schroeder-like methods for the simultaneous inclusion of polynomial zeros. Computing 16(2002), 185-199.

Interval root-finding methods of Laguerre-like type. Computing 16 (2002), 199-211.

Weierstrass-like methods with corrections for the inclusion of polynomial zeros. Computing 75(2005), 55-69.

  1.  

Complex interval arithmetic and its applications. Wiley-VCH, Berlin 1998

On the $k$-th root in circular arithmetic. Computing 33(1984), 27-35.

On some applications of circular complex functions. Computing 41(1989), 141-148.

Efficient iterative algorithms for bounding the inverse of a matrix. Computing 44(1990), 237-244.

Generalized Ostrowski’s root-finding method. Appl. Math. Comput. 57(1993), 2-3.

On the construction of simultaneous methods for multiple zeros. Nonlinear Analysis 30 (1997), 669-676.

Laguerre-like methods for the simultaneous approximation of polynomial zeros. Computing 15(2001), 189-210.

Schroeder-like methods for the simultaneous inclusion of polynomial zeros. Computing 16(2002), 185-199.

Interval root-finding methods of Laguerre-like type. Computing 16 (2002), 199-211.

Weierstrass-like methods with corrections for the inclusion of polynomial zeros. Computing 75(2005), 55-69.

  1.  

Complex interval arithmetic and its applications. Wiley-VCH, Berlin 1998

On the $k$-th root in circular arithmetic. Computing 33(1984), 27-35.

On some applications of circular complex functions. Computing 41(1989), 141-148.

Efficient iterative algorithms for bounding the inverse of a matrix. Computing 44(1990), 237-244.

Generalized Ostrowski’s root-finding method. Appl. Math. Comput. 57(1993), 2-3.

On the construction of simultaneous methods for multiple zeros. Nonlinear Analysis 30 (1997), 669-676.

Laguerre-like methods for the simultaneous approximation of polynomial zeros. Computing 15(2001), 189-210.

Schroeder-like methods for the simultaneous inclusion of polynomial zeros. Computing 16(2002), 185-199.

Interval root-finding methods of Laguerre-like type. Computing 16 (2002), 199-211.

Weierstrass-like methods with corrections for the inclusion of polynomial zeros. Computing 75(2005), 55-69.

  1.  

Complex interval arithmetic and its applications. Wiley-VCH, Berlin 1998

On the $k$-th root in circular arithmetic. Computing 33(1984), 27-35.

On some applications of circular complex functions. Computing 41(1989), 141-148.

Efficient iterative algorithms for bounding the inverse of a matrix. Computing 44(1990), 237-244.

Generalized Ostrowski’s root-finding method. Appl. Math. Comput. 57(1993), 2-3.

On the construction of simultaneous methods for multiple zeros. Nonlinear Analysis 30 (1997), 669-676.

Laguerre-like methods for the simultaneous approximation of polynomial zeros. Computing 15(2001), 189-210.

Schroeder-like methods for the simultaneous inclusion of polynomial zeros. Computing 16(2002), 185-199.

Interval root-finding methods of Laguerre-like type. Computing 16 (2002), 199-211.

Weierstrass-like methods with corrections for the inclusion of polynomial zeros. Computing 75(2005), 55-69.

  1.  

Complex interval arithmetic and its applications. Wiley-VCH, Berlin 1998

On the $k$-th root in circular arithmetic. Computing 33(1984), 27-35.

On some applications of circular complex functions. Computing 41(1989), 141-148.

Efficient iterative algorithms for bounding the inverse of a matrix. Computing 44(1990), 237-244.

Generalized Ostrowski’s root-finding method. Appl. Math. Comput. 57(1993), 2-3.

On the construction of simultaneous methods for multiple zeros. Nonlinear Analysis 30 (1997), 669-676.

Laguerre-like methods for the simultaneous approximation of polynomial zeros. Computing 15(2001), 189-210.

Schroeder-like methods for the simultaneous inclusion of polynomial zeros. Computing 16(2002), 185-199.

Interval root-finding methods of Laguerre-like type. Computing 16 (2002), 199-211.

Weierstrass-like methods with corrections for the inclusion of polynomial zeros. Computing 75(2005), 55-69.

  1.  

Complex interval arithmetic and its applications. Wiley-VCH, Berlin 1998

On the $k$-th root in circular arithmetic. Computing 33(1984), 27-35.

On some applications of circular complex functions. Computing 41(1989), 141-148.

Efficient iterative algorithms for bounding the inverse of a matrix. Computing 44(1990), 237-244.

Generalized Ostrowski’s root-finding method. Appl. Math. Comput. 57(1993), 2-3.

On the construction of simultaneous methods for multiple zeros. Nonlinear Analysis 30 (1997), 669-676.

Laguerre-like methods for the simultaneous approximation of polynomial zeros. Computing 15(2001), 189-210.

Schroeder-like methods for the simultaneous inclusion of polynomial zeros. Computing 16(2002), 185-199.

Interval root-finding methods of Laguerre-like type. Computing 16 (2002), 199-211.

Weierstrass-like methods with corrections for the inclusion of polynomial zeros. Computing 75(2005), 55-69.

  1.  

Complex interval arithmetic and its applications. Wiley-VCH, Berlin 1998

On the $k$-th root in circular arithmetic. Computing 33(1984), 27-35.

On some applications of circular complex functions. Computing 41(1989), 141-148.

Efficient iterative algorithms for bounding the inverse of a matrix. Computing 44(1990), 237-244.

Generalized Ostrowski’s root-finding method. Appl. Math. Comput. 57(1993), 2-3.

On the construction of simultaneous methods for multiple zeros. Nonlinear Analysis 30 (1997), 669-676.

Laguerre-like methods for the simultaneous approximation of polynomial zeros. Computing 15(2001), 189-210.

Schroeder-like methods for the simultaneous inclusion of polynomial zeros. Computing 16(2002), 185-199.

Interval root-finding methods of Laguerre-like type. Computing 16 (2002), 199-211.

Weierstrass-like methods with corrections for the inclusion of polynomial zeros. Computing 75(2005), 55-69.

Збирни подаци научне, односно уметничке и стручне активности наставника

Укупан број цитата

 

Укупан број радова са SCI (SSCI) листе

 

Тренутно учешће на пројектима

Домаћи

Међународни

Усавршавања

 

Други подаци које сматрате релевантним