Numerical Analysis Research Group
    Publications since 1997

  1. I. Area, E. Godoy, P. Woźny, S. Lewanowicz, and A. Ronveaux, Formulae relating little q-Jacobi, q-Hahn and q-Bernstein polynomials: Application to the q-Bezier curve evaluation, Integral Transforms and Special Functions 15 (2004), 375-385.

  2. A. Bartkowiak, A. Szustalewicz, S. Cebrat, P. Mackiewicz, Kohonen's self-organizing maps as applied to graphical visualization of some yeast DNA data, Biometrical Letters 40 (2003), 37--56.

  3. A. Bartkowiak, A. Vassilopoulos, N. Evelpidou, Choosing data vectors representing a huge data set: Kohonen's SOM applied to the Kefallinia erosion data, Proc. First Int. Conf. on Environmental Research and Assessment, Bucharest, Romania, March 23-27, 2003, 505-521, ISBN 973-558-077-2, CD-ROM, copyright Ars Docendi Publishing House, Bucharest, Romania.

  4. A. Bartkowiak, A. Szustalewicz, N. Evelpidou, A. Vassilopoulos, Choosing data vectors representing a huge data set: a comparison of Kohonen's maps and the neural gas method, Proc. First Int. Conf. on Environmental Research and Assessment, Bucharest, Romania, March 23--27, 2003, 561--572, ISBN 973-558-077-2, CD-ROM, copyright Ars Docendi Publishing House, Bucharest, Romania.

  5. A. Bartkowiak, J. Zdziarek, Outliers - a continuing problem, Bulletin of the Int. Statistical Institute, Proc. 54th Session, Berlin August 2003. Electr. publ., pp. 1-2.

  6. A. Bartkowiak, J. Zdziarek, N. Evelpidou, N. Vassilopoulos, Choosing representative data items: Kohonen, Neural Gas or Mixture Model? A case study of erosion data, Proc. ACS'2003, Szczecin-Międzyzdroje October 2003. Electr. publ., 8 pp.

  7. A. Bartkowiak, Th. Gournelos, N. Evelpidou, and A. Vassilopoulos, Self-organizing maps - a helpful tool in clustering areas with similar factors of erosion risk, Proc. 6th Pan-Hellenic Geographical Congress of the Hellenic Geographical Society, Thessaloniki, 2002, Vol. 2, Carthography, Remote Sensing and Environment, pp. 87-94.

  8. A. Bartkowiak, N. Evelpidou, A. Vassilopoulos, Problems encountered when determining the risk of an event in case of imprecise information, invited paper, T. Burzyński, W. Cholewa, W. Moczulski (eds), AI-METH 2002, Silesian Univ. of Technology, Gliwice, pp. 19-26.

  9. A. Bartkowiak, An interesting grouping of Polish voievodeships obtained by self-organizing maps, Biometrical Letters 38 (2001), 67-79.

  10. A. Bartkowiak, Finding multivariate outliers, Prague Stochastics 1998, Volume 1, pp. 15-20.

  11. A. Bartkowiak, Identifying outliers - a look by a grand tour, in D. Almorza, H.M. Ramos (Eds), Applied Sciences and the Environment, WITPRESS, Boston, Southampton, 1998, pp. 13-21.

  12. A. Bartkowiak, A. Szustalewicz, Detecting multivariate outliers by a grand tour, Machine Graphics and Vision 6 (1997), 487-505.

  13. A. Bartkowiak, and A. Szustalewicz,, Some issues connected with a 3D representation of multivariate data points, Machine Graphics & Vision 5 (1996), 563-577.

  14. A. Bartkowiak, A semi-stochastic grand tour for identifying outliers and finding a clean subset, Biometrical Letters 38 (2001), 11-31.

  15. A. Bartkowiak, Identifying Multivariate Outliers by Dynamic Graphics -- As Applied to Some Medical Data, in M. Ahsanullah and F. Yildirim (Eds), Applied Statistical Science IV, Nova Science Publishers, New York, pp. 29-36.

  16. A. Bartkowiak, and A. Szustalewicz, Outliers - finding and classifying which genuine and which spurious, Computational Statistics, 15 (2000), 3-12.

  17. A. Bartkowiak, P. Piotrowicz, and A. Szustalewicz, Detecting outliers in multivariate data by use of Kohonen's self-organizing maps, J. Sołdek, J. Pejaś, Eds., ACS, Advanced Computer Systems, Sixth International Conference, Szczecin November 1999, Proceedings, Fac. of Computer Science & Information Systems, Technical University of Szczecin, Informa, 321-328.

  18. A. Bartkowiak, A. Szustalewicz, Watchings steps of a grand tour implementations , Machine Graphics & Vision 7 (1998), 655-680.

  19. A. Bartkowiak, A. Szustalewicz, and J. Zdziarek, Logistic Discriminant function - how much advantages over the linear one? Biometrical Letters 37 (2000), 21-40.

  20. A. Bartkowiak, A. Szustalewicz, Two Non-Conventional Methods for Visualization of Multivariate Two-Group Data, Biocybernetics and Biomedical Engineering 20 (2000), 5-20.

  21. A. Bartkowiak, K. Ziętak Correcting possible non-positiveness of a covariance matrix estimated elementwise in a robust way, in J. Sołdek, J. Pejaś, Eds, Advanced Computer Systems, ACS'2000, Proceedings, Szczecin, Poland, 23-25 October, 2000, Fac. of Computer Science & Information Systems, Technical University of Szczecin, 91-96.

  22. A. Bartkowiak, K. Ziętak, Backprojection of data vectors using a given covariance matrix, [in:] J. Sołdek, J. Pejaś (Eds), Advanced Computer Systems, Kluwer Academic Publishers, 2002, pp. 27-38.

  23. W. Bożejko, J. Grabowski, M. Wodecki, A block approach tabu search algorithm for single machine total weighted tardiness problem, Computers & Industrial Engineering, in press.

  24. W. Bożejko, M. Wodecki, Theoretical properties of multimoves in metaheuristics in aspect involutions, Proceedings of Tenth International Workshop on Project Management and Scheduling, in press.

  25. W. Bożejko, M. Wodecki, A new inter-island genetic operator for optimization problem with block properties, Lecture Notes in Artificial Intelligence, Springer Verlag, in press.

  26. W. Bożejko, M. Wodecki, Parallel population training algorithm for the single machine total tardiness problem, IEEE Computational Intelligence Society, in press.

  27. W. Bożejko, M. Wodecki, Evolutionary Heuristics for Hard Permutational Optimization Problems, International Journal of Computational Intelligence Research 2 (2006), in press.

  28. W. Bożejko, M. Wodecki, On the theoretical properties of swap multimoves, Operations Research Letters, in press.

  29. J. Grabowski, M. Wodecki, A very fast tabu search algorithm for the job shop problem, in: Metaheuristic Optimization Via Menory and Evolution, Tabu Search and Scatter Search, ed. C. Rego, B.Alidaee, Kluwer, 2005, pp. 117-144.

  30. W. Bożejko, M. Wodecki, A hybrid evolutionary algorithm for the permutation optimization problems, ISDA 05, IEEE Computer Society, 2005, 326-331.

  31. W. Bożejko, M. Wodecki, Task realization's optimization with earliness and tardiness penaltiess in distributed computation systems, Lecture Notes in Computer Science, vol. 3528, 2005, 69-75.

  32. W. Bożejko, M. Wodecki, Parallel Evolution Heuristic Approach for the Traveling Salesman Problem, International Conference on Numerical Analysis and Applied Mathematics, WILEY-VCH, 2005, 90-93.

  33. W. Bożejko, J.Grabowski, M. Wodecki, Block Approach-local Search Algorithm for Single Machine Total Weighted Problem, Automatyka 9 (2005), 25-35.

  34. W. Bożejko, M. Wodecki, A hybrid evolutionary algorithm for the permutation optimization problems, IEEE Computer Society (2005), 326-331.

  35. W. Bożejko, W. Karczewski, M. Wodecki, Metody rozwiązywania problemów optymalizacji dyskretnej z niepewnymi danymi, Zastosowania Teorii Systemów, nr 3, AGH, str. 19-29.

  36. W. Bożejko, M. Wodecki, Task realization's optimization with earliness and tardiness penalties in distributed computation systems, Lecture Notes in Computer Science, Vol. 3528, Springer Verlag, 2005, pp. 69-75.

  37. W. Bożejko, M. Wodecki, Parallel tabu search method approach for very difficult permutation scheduling problems, IEEE Computer Society P2080 (2004), 156-161.

  38. W. Bożejko, M. Wodecki, Parallel genetic algorithm for minimizing total weighted completion time, Lecture Notes in Computer Science, Vol. 3070, Springer Verlag, 2004, pp. 400-405.

  39. W. Bożejko, M. Wodecki, The new concepts in parallel simulated annealing method, Lecture Notes in Computer Science, Vol. 3070, Springer Verlag, 2004, pp. 853-859.

  40. W. Bożejko, M. Wodecki, Parallel genetic algorithm for the flow shop scheduling problem, Lecture Notes in Computer Science, Vol. 3019, Springer Verlag, 2004, pp. 566-571.

  41. W. Bożejko, M. Wodecki, Solving the flow shop problem by parallel simulated annealing, Lecture Notes in Computer Science, Vol. 2328, Springer Verlag, 2002, pp. 236-247.

  42. W. Bożejko, M. Wodecki, Solving the flow shop problem by parallel tabu search, IEEE Computer Society PR01730 (2002), 189-194.

  43. P. Keller, A practical algorithm for computing Cauchy principal value integrals of oscillatory functions , Applied Mathematics and Computation 218 (2012), 4988-5001.

  44. P. Keller, A method for indefinite integration of oscillatory and singular functions, Numerical Algorithms 46 (2007), 219-251.

  45. P. Keller, Indefinite integration of oscillatory functions, Appl. Math. (Warsaw) 25 (1998), 1-12.

  46. P. Keller, P. Woźny, On the convergence of the method for indefinite integration of oscillatory and singular functions , Applied Mathematics and Computation 216 (2010), 989-998.

  47. S. Lewanowicz, P. Woźny and R. Nowak, Structure relations for the bivariate big q-Jacobi polynomials, Applied Mathematics and Computation 219 (2013), 8790-8802.

  48. S. Lewanowicz, P. Woźny and P. Keller, Polynomial approximation of rational Bezier curves with constraints, Numerical Algorithms 59 (2012), 607-622.

  49. S. Lewanowicz and P. Woźny , Bezier representation of the constrained dual Bernstein polynomials , Applied Mathematics and Computation 218 (2011), 4580-4586.

  50. S. Lewanowicz and P. Woźny , Multi-degree reduction of tensor product Bezier surfaces with general boundary constrains , Applied Mathematics and Computation 217 (2011), 4596-4611.

  51. S. Lewanowicz, P. Woźny, Two-variable orthogonal polynomials of big q-Jacobi type , Journal of Computational and Applied Mathematics 233 (2010), 1554-1561.

  52. S. Lewanowicz, P. Woźny, I. Area and E. Godoy , Multivariate generalized Bernstein polynomials. Identities for orthogonal polynomials of two variables, Numerical Algorithms 49 (2008), 199-220.

  53. S. Lewanowicz and P. Woźny , Dual generalized Bernstein basis , Journal of Approximation Theory 138 (2006), 129-150.

  54. S. Lewanowicz and P. Woźny , Connections between two-variable Bernstein and Jacobi polynomials on the triangle , J. Comput. Appl. Math. 197 (2006), 520-533.

  55. S. Lewanowicz and P. Woźny , Generalized Bernstein polynomials , BIT Numerical Mathematics 44 (2004), 63-78.

  56. S. Lewanowicz and P. Woźny , Recurrence relations for the coefficients in series expansions with respect to semi-classical orthogonal polynomials , Numerical Algorithms 35 (2004), 61-79.

  57. S. Lewanowicz, Construction of recurrences for the coefficients of expansions in q-classical orthogonal polynomials , J. Comput. Appl. Math. 153 (2003), 295-309.

  58. S. Lewanowicz, Representations for the first associated q-classical orthogonal polynomials , J. Comput. Appl. Math. 150 (2003), 311-327.

  59. S. Lewanowicz, Representations for the parameter derivatives of the classical orthogonal polynomials , Rend. Circ. Mat. Palermo, Ser. II, Suppl. 68 (2002), 599-613.

  60. S. Lewanowicz, Recurrences for the coefficients of series expansions with respect to classical orthogonal polynomials , Appl. Math. 29 (2002), 97-116.

  61. S. Lewanowicz, Recursion formulae for basic hypergeometric functions , in Numerical Analysis in the 20th Century, Vol. I: Approximation Theory, eds. J. Wimp and L. Wuytack, J. Comput. Appl. Math. 121 (2000), 297-312.

  62. S. Lewanowicz, E. Godoy, I. Area, A. Ronveaux, A. Zarzo , Recurrence relations for the coefficients of the Fourier series expansions with respect to q-classical orthogonal polynomials, Numerical Algorithms 23 (2000), 31-50.

  63. S. Lewanowicz, Recurrence relations for the connection coefficients of orthogonal polynomials of a discrete variable on the lattice x(s)=q^{2 s} , J. Comput. Appl. Math. 99 (1998), 275-286.

  64. S. Lewanowicz, Generalized Watson's summation formula for 3F2(1) , J. Comput. Appl. Math. 86 (1997), 375-386.

  65. S. Lewanowicz, On the fourth-order difference equation for the associated Meixner polynomials, J. Comput. Appl. Math. 80 (1997), 351-358.

  66. S. Belmehdi, S. Lewanowicz, and A. Ronveaux, Linearization of product of classical orthogonal polynomials of a discrete variable, Appl. Math. (Warsaw) 24 (1997), 445-455.

  67. S. Lewanowicz, Recurrence relations for the connection coefficients of the orthogonal polynomials of a discrete variable, J. Comput. Appl. Math. 76 (1996), 213-229.

  68. S. Lewanowicz, Second-order recurrence relation for the linearization coefficients of classical orthogonal polynomials, J. Comput. Appl. Math. 69 (1996), 159-170.

  69. R. Nowak , A method of acceleration of some continued fractions II , Numerical Algorithms 61 (2012), DOI 10.1007/s11075-012-9642-2.

  70. R. Nowak , A method of acceleration of some continued fractions , Numerical Algorithms 41 (2006), 297-317.

  71. A. Szustalewicz, A. Vassilopoulos, Calculating the fractal dimension of river basins, comparison of several methods, in K. Saeed, R. Mosdorf, J. Pejaś, P. Himola, Z. Sosnowski (Eds), Image Analysis, Computer Graphics, Security Systems and Artificial Intelligence Applications, University of Finanse and Management in Białystok, Białystok 2005, vol. 1, pp. 449-460.

  72. A. Szustalewicz, Numerical problems with evaluating the fractal dimension of real data, in J. Pejaś, A. Piegat (Eds), Enhanced Methods in Computer Security, Biometric and Artificial Intelligence Systems, Kluwer Academic Publishers, Springer, New York 2005, pp. 273-283.

  73. A. Szustalewicz, Visualisation of multivariate data using parallel coordinate plots and Kohonen's SOM's. Which is better? [in] J. Sołdek, and J. Pejaś (eds.), Advanced Computer Systems, Kluwer Academic Publishers, Boston, The Kluwer Int. Series in Engineering and Computer Science, 89-98.

  74. P. Wnuk-Lipiński, Dependency Mining in Large Sets of Stock Market Trading Rules, [in] Enhanced Methods in Computer Security, Biometric and Intelligent Systems, ed. J. Pejas, A. Piegat, Kluwer Academic Publishers, 2005, pp.329-336.

  75. P. Wnuk-Lipiński, J. Korczak, Performance Measures in an Evolutionary Stock Trading Expert System, [in] Proceedings of the International Conference on Computational Science, ICCS 2004, ed. M. Bubak, G. van Albada, P. Sloot, J. Dongarra, Lecture Notes in Computer Science, vol. 3039, Springer, 2004, pp.835-842.

  76. J. Korczak, P. Wnuk-Lipiński, Evolutionary Building of Stock Trading Experts in a Real-Time System, [in] Proceedings of the 2004 Congress on Evolutionary Computation, CEC 2004, Portland, USA, 2004, pp.940-947.

  77. P. Wnuk-Lipiński, Clustering of Large Number of Stock Market Trading Rules, [in] Proceedings of the 16th Symposium on Computational Statistics, CompStat 2004, ed. J. Antoch, Springer, 2004, pp.1397-1404.

  78. P. Wnuk-Lipiński, K. Michalak, Prediction of High Increases in Stock Prices using Neural Networks, [in] Proceedings of the 16th Symposium on Computational Statistics, CompStat 2004, ed. J. Antoch, Springer, 2004, pp.1465-1472.

  79. P. Wnuk-Lipiński, J. Korczak, and P. Roger, Evolution Strategy in Portfolio Optimization, [in] Artificial Evolution, ed. P. Collet, LNCS 2310, Springer, 2002, 156-167.

  80. P. Wnuk-Lipiński, and J. Korczak , Design of Stock Trading System based on Intelligent Agents, [in] Proceedings of 9th International Multi-Conference on Advanced Computer Systems, Production System Design, Supply Chain Management and Logistics, ed. A. Dolgui, J. Soldek, O. Zaikin, Technical University of Szczecin, Szczecin, 2002, 177-186.

  81. P. Wnuk-Lipiński, J. Korczak, and P. Roger, Evolution Strategy in Portfolio Optimization, [in] Proceedings of 5th International Conference on Artificial Evolution, ed. P. Collet, Ecole Polytechnique France, 2001, pp. 225-236.

  82. M. Wodecki, J. Grabowski, A very fast tabu search algorithm for the permutation flow shop problem with makespan criterium, Computers & Operations Research 31 (2004), 1891-1909.

  83. P. Woźny, Construction of dual B-spline functions, Journal of Computational and Applied Mathematics (2013), accepted.

  84. P. Woźny, A short note on Jacobi-Bernstein connection coefficients, Applied Mathematics and Computation 222 (2013), 53-57.

  85. P. Woźny, Construction of dual bases, Journal of Computational and Applied Mathematics 245 (2013), 75-85.

  86. P. Woźny, Simple algorithms for computing the Bezier coefficients of the constrained dual Bernstein polynomials, Applied Mathematics and Computation 219 (2012), 2521-2525.

  87. P. Woźny, Efficient algorithm for summation of some slowly convergent series, Applied Numerical Mathematics 60 (2010), 1442-1453.

  88. P. Woźny, Recurrence relations for the coefficients of expansions in classical orthogonal polynomials of a discrete variable, Appl. Math. (Warsaw) 30 (2003), 89-107.

  89. P. Woźny and S. Lewanowicz , Constrained multi-degree reduction of triangular Bezier surfaces using dual Bernstein polynomials , Journal of Computational and Applied Mathematics 235 (2010), 785-804.

  90. P. Woźny and S. Lewanowicz, Multi-degree reduction of Bezier curves with constraints, using dual Bernstein basis polynomials, Computer Aided Geometric Design 26 (2009), 566-579.

  91. P. Woźny and R. Nowak, Method of summation of some slowly convergent series, Applied Mathematics and Computation 215 (2009), 1622-1645.

  92. K. Ziętak, Strict spectral approximation of a matrix and some related problems, Appl. Math. 24 (1997), 267-280.

  93. K. Ziętak, Orthant-monotonic norms and overdetermined linear systems, J. Approx. Theory 88 (1997), 209-227.